Joint Routing and Scheduling for Dynamic Applications in Multicast Time-Sensitive Networks

Li, Cong; Zhang, Chenyu; Zheng, Wei; Wen, Xiangming; Lu, Zhaoming; Zhao, Jiawen

doi:10.1109/iccworkshops50388.2021.9473540

Cited by 19 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sequential solving makes online recon-figuration challenging to solve and optimize, as poorly designed routes lead to solving failures and backtracking to new routes, which repeatedly increases solving time and reduces solving efficiency [24]. Therefore, it is more sensible to solve traffic routing and scheduling as a single optimization problem with joint routing and scheduling techniques, whereby ILP is a more widely adopted design approach [17,[25][26][27]. The incremental solution approach further compresses the solution time of the ILP and makes online scheduling effective [14].…”

Section: Related Workmentioning

confidence: 99%

“…A larger period and a shorter length of the flow are associated with an easier scheduling process. Several studies have explored the impact of period and flow length on routing or scheduling [17,26,36]. Differences in SC proposed in the present study can be summarized as: (1) the role of flow length is fully quantitatively analyzed instead of arbitrarily combining it with the impact caused by period; (2) the focus of this study was to explore the application of SC in the reconfiguration process; (3) the approach of this paper applies to different slot sizes and can be used for VTS.…”

Section: Scheduling Compatibility (Sc)mentioning

confidence: 99%

See 1 more Smart Citation

Run-Time Reconfiguration Strategy and Implementation of Time-Triggered Networks

Huagang

et al. 2022

Electronics

View full text Add to dashboard Cite

Time-triggered networks are deployed in avionics and astronautics because they provide deterministic and low-latency communications. Remapping of partitions and the applications that reside in them that are executing on the failed core and the resulting re-routing and re-scheduling are conducted when a permanent end-system core failure occurs and local resources are insufficient. We present a network-wide reconfiguration strategy as well as an implementation scheme, and propose an Integer Linear Programming based joint mapping, routing, and scheduling reconfiguration method (JILP) for global reconfiguration. Based on scheduling compatibility, a novel heuristic algorithm (SCA) for mapping and routing is proposed to reduce the reconfiguration time. Experimentally, JILP achieved a higher success rate compared to mapping-then-routing-and-scheduling algorithms. In addition, relative to JILP, SCA/ILP was 50-fold faster and with a minimal impact on reconfiguration success rate. SCA achieved a higher reconfiguration success rate compared to shortest path routing and load-balanced routing. In addition, scheduling compatibility plays a guiding role in ILP-based optimization objectives and ‘reconfigurable depth’, which is a metric proposed in this paper for the determination of the reconfiguration potential of a TT network.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Scheduling Compatibility (Sc)mentioning

confidence: 99%

Run-Time Reconfiguration Strategy and Implementation of Time-Triggered Networks

Huagang

et al. 2022

Electronics

View full text Add to dashboard Cite

show abstract

“…The article [23] developed a novel joint traffic routing and scheduling algorithm to compute routes for TT traffic and construct the schedules. The joint routing and scheduling problem for multicast time-sensitive traffic based on ILP was formulated in [24,25]. The configuration of routing and scheduling problem [26] was likewise investigated based on the CQF model.…”

Section: Scheduling Solution Overviewmentioning

confidence: 99%

Hybrid traffic scheduling in time‐sensitive networking for the support of automotive applications

Nie,

Su,

Zhao

et al. 2023

IET Communications

View full text Add to dashboard Cite

Time‐sensitive networking (TSN) is considered one of the most promising solutions to address real‐time scheduling in in‐vehicle network due to its capabilities for providing deterministic service. The TSN working group proposed various traffic shaping mechanisms, while deterministic scheduling of hybrid traffic is still not effectively solved since the traffic requirements are difficult to satisfy by standalone or combined mechanisms with fixed time slot divisions. This article presents a time‐aware multi‐cyclicqueuing and forwarding scheduling model, that integrates the no‐wait enabled time‐aware shaper and multi‐cyclic queuing and forwarding shaping models. Then, a scheduling solution, dubbed “TSN scheduling optimizer” (TSO) is proposed that combines optimization methods and incremental techniques. TSO aims to balance the load to maximize flow schedulability while guaranteeing the service requirements of hybrid traffic. Simulation evaluations through OMNeT++ provide a performance assessment of this proposed scheduling model, which can satisfy multiple types of traffic transmission requirements. Furthermore, TSO is compared with other baseline scheduling solutions, and TSO shows efficacy regarding execution time and schedulability.

show abstract

“…Currently, the ILP method based on integer linear programming [3] and SMT [4] based on satisfactibility theory account for the majority. In addition, some heuristic algorithms [5] have been proposed.…”

Section: Introductionmentioning

confidence: 99%

Flow scheduling and network updates in time-sensitive software-defined networks

Nie,

Yao,

Wang

et al. 2023

Fourth International Conference on Artificial Intelligence and Electromechanical Automation (AIEA 2023)

View full text Add to dashboard Cite

With the further deepening and upgrading of digitization and informatization of industrial enterprises, the industrial network needs higher flexibility and reliability. As a comprehensive, unified, and standard new industrial Ethernet technology, Time-sensitive network technology makes industrial network technology and industrial ecology more open and dynamic. Time-sensitive Software-defined network introduces the concept of software-defined network based on time-sensitive network, which makes the whole network more real-time and flexible. With the emergence of dynamic applications, time-sensitive networks also need to be updated in real-time. The old update mechanism cannot ensure that the new and old flow is separate from one another, resulting in network congestion. In this paper, a new scheduling update scheme is proposed, which eliminates the conflict between the old and new traffic by separating the old scheduling scheme from the new. The experimental results on two different network topologies show that the update time of the proposed scheduling scheme is shortened by 5.68% compared with the traditional scheduling scheme. The network resource utilization of the two network topologies decreased by 3.3% and 10.02%, respectively.

show abstract

Joint Routing and Scheduling for Dynamic Applications in Multicast Time-Sensitive Networks

Cited by 19 publications

References 15 publications

Run-Time Reconfiguration Strategy and Implementation of Time-Triggered Networks

Run-Time Reconfiguration Strategy and Implementation of Time-Triggered Networks

Hybrid traffic scheduling in time‐sensitive networking for the support of automotive applications

Flow scheduling and network updates in time-sensitive software-defined networks

Contact Info

Product

Resources

About