A Period-Aware Routing Method for IEEE 802.1Qbv TSN Networks

Huang, Kai; Wu, Jingkang; Jiang, Xiaowen; Xiong, Dongliang; Huang, Kun; Yao, Hao; Xu, Wenyuan; Peng, Yonggang; Liu, Zhili

doi:10.3390/electronics10010058

Cited by 13 publications

(6 citation statements)

References 27 publications

(62 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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%

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: 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

“… (17) Based on the results, we can confirm the conflicting packets. For example, if k =0, CFK occurs for the packets numbered [27*45+10, 14*45+5, 27*10+11] from the three flows.…”

Section:   mentioning

confidence: 63%

“…The flow route and schedule are jointly determined, whereas the update is necessary when network structure changes or new flow occurs. Unfortunately, the delay caused by the conflicts between the time-sensitive flows in one port is rarely considered to date [17]. Moreover, current researches only focus on the schedulability analysis for simple network topology, such as automotive in-vehicle network [18] and the network with tens of flows in industrial scenarios [19].…”

mentioning

confidence: 99%

An Intelligent Deterministic Scheduling Method for Ultralow Latency Communication in Edge Enabled Industrial Internet of Things

Yang

et al. 2023

IEEE Trans. Ind. Inf.

View full text Add to dashboard Cite

Edge enabled Industrial Internet of Things (IIoT) platform is of great significance to accelerate the development of smart industry. However, with the dramatic increase in real-time IIoT applications, it is a great challenge to support fast response time, low latency, and efficient bandwidth utilization. To address this issue, Time Sensitive Network (TSN) is recently researched to realize low latency communication via deterministic scheduling. To the best of our knowledge, the combinability of multiple flows, which can significantly affect the scheduling performance, has never been systematically analyzed before. In this article, we first analyze the combinability problem. Then a non-collision theory based deterministic scheduling (NDS) method is proposed to achieve ultra-low latency communication for the time-sensitive flows. Moreover, to improve bandwidth utilization, a dynamic queue scheduling (DQS) method is presented for the best-effort flows. Experiment results demonstrate that NDS/DQS can well support deterministic ultra-low latency services and guarantee efficient bandwidth utilization.

show abstract

“…Atallah et al [23] introduces a graph-based conflict degree perception technology that minimizes stream conflicts in scalable iterative integer linear programming scheduling, thereby enhancing the scheduling success rate. Huang et al [24] discussed the associativity between streams of different time periods and proposed a period-aware routing algorithm to improve the success rate of scheduling.…”

Section: Related Workmentioning

confidence: 99%

Reliability Optimization of Traffic Routing in Train Communication Networks Based on Faulty Link Diagnosis

Ren,

He,

Liu

et al. 2024

IEEJ Transactions Elec Engng

View full text Add to dashboard Cite

With the increasing adoption of industrial Ethernet in train communication network (TCN), the limitations of insufficient reliability and incompatibility between different Ethernet technologies have become increasingly apparent. To address these challenges, time‐sensitive networking (TSN) has emerged as a solution, enabling multi‐network convergence and enhancing data transmission determinism and reliability through techniques such as frame replication and elimination for reliability (FRER). However, the utilization of these policies will adversely affect schedulability due to increased network load. To address the issue of link failures in TCN topologies, a routing policy based on faulty link diagnosis is proposed. The proposed policy utilizes an improved max‐min ant system (IMMAS) for diagnosing and resolving faulty links. Furthermore, a routing optimization algorithm is introduced to enhance transmission reliability by planning alternative paths for traffic. To evaluate the performance of the proposed routing algorithm, multiple sets of test cases are conducted separately under different failure scenarios to compare them with other routing policies. The results demonstrate the superior reliability of the proposed routing policy over alternative approaches. Additionally, the traffic utilizing the proposed routing policy show improved schedulability following integer linear programming (ILP) scheduling. © 2024 Institute of Electrical Engineer of Japan and Wiley Periodicals LLC.

show abstract

A Period-Aware Routing Method for IEEE 802.1Qbv TSN Networks

Cited by 13 publications

References 27 publications

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

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

An Intelligent Deterministic Scheduling Method for Ultralow Latency Communication in Edge Enabled Industrial Internet of Things

Reliability Optimization of Traffic Routing in Train Communication Networks Based on Faulty Link Diagnosis

Contact Info

Product

Resources

About