Flow Attribute-Aware Redundant Routing and Scheduling for Time-Triggered Flows in Time-Sensitive Networking
To address the issue of reduced network schedulability when the shortest path is adopted for all transmission traffic,a flow attribute-aware evaluation function and redundant routing scheduling method for time-triggered flows are proposed.The heuristic algorithm is used to solve the routing scheme with the largest evaluation function,and the integer linear programming is used to solve the scheduling.The simulation experiment results demonstrate that,in the region-oriented electronic and electrical architecture network topology,compared with the K Shortest Path(KSP)and Degree of Conflict(DoC)routing schemes,the proposed scheme enhances the success rate of scheduling by 38.9%and 14%respectively while guaranteeing network reliability,and further validates the effectiveness of this method.
In-vehicle ethernetTime-Sensitive Networking(TSN)Routing and schedulingRedundant
万方数据
维普
