Routing and Scheduling of Time-Triggered Traffic in Time-Sensitive Networks

Atallah, Ayman A.; Hamad, Ghaith Bany; Mohamed, Otmane Aït

doi:10.1109/tii.2019.2950887

Cited by 126 publications

(67 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The work in [16] presented that the ULL communications in 5G and beyond networks will likely rely on the IEEE 802.1 time sensitive networking (TSN) and the emerging IETF deterministic networking (DetNet) standards. In [31]- [33], it was highlighted that the TSN and DetNet standards could establish reliable communication channels for a given traffic flow over the network with deterministic quality of service (QoS) guarantees. The standards can guarantee QoS in terms of bounded ULL, jitter, congestion loss, and reliability, regardless of the other ongoing flows competing for the same resources.…”

Section: A Motivationmentioning

confidence: 99%

“…When bounded ULL is required, i.e., deterministic latency where all frames of a given application traffic flow must not exceed a prescribed ULL bound, the TSN and DetNet standards present effective mechanisms [10], [16], [31]- [33], [51]. Thus, the TSN and DetNet standards ensure real-time guarantees, determinism, high fault-tolerance, and clock synchronization mechanisms.…”

Section: Enabling Techniques For Low Latency and Reliable Communimentioning

confidence: 99%

“…In such situations, the TSN and DetNet standards can be employed to ensure zero congestion loss, low latency variations (jitter), deterministic ULL, and high link reliability. Thus, the TSN and DetNet standards ensure real-time guarantees, determinism, high fault-tolerance, and clock synchronization mechanisms over standard Ethernet [16], [31]- [33], [44], [92]- [96]. Overall, the TSN and DetNet standards enable co-existence of high priority, deterministic, and elastic traffic.…”

Section: G Tsn and Detnet Standardsmentioning

confidence: 99%

“…The standards define how frames belonging to a particular traffic class or having a particular priority are handled by TSN-enabled bridges. Based on the discussions in [16], [ [16], [31]- [33], [44], [51], [92]- [97].…”

Section: G Tsn and Detnet Standardsmentioning

confidence: 99%

“…2) Co-located common master for both baseband unit (BBU) and remote radio head (RRH) [16]. To enable real-time communications, the 802.1AS standard employs precise time synchronization which allows all bridges and end systems in the network to synchronize their local clocks by less than 1 μs precision [33]. In particular, each time-triggered (TT) frame is transmitted according to a static schedule that allows deterministic communication with bounded jitter and endto-end latency.…”

Section: G Tsn and Detnet Standardsmentioning

confidence: 99%

See 4 more Smart Citations

A Classification of the Enabling Techniques for Low Latency and Reliable Communications in 5G and Beyond: AI-Enabled Edge Caching

Mutalemwa

Shin

2020

IEEE Access

View full text Add to dashboard Cite

Section: A Motivationmentioning

confidence: 99%

Section: Enabling Techniques For Low Latency and Reliable Communimentioning

confidence: 99%

Section: G Tsn and Detnet Standardsmentioning

confidence: 99%

Section: G Tsn and Detnet Standardsmentioning

confidence: 99%

Section: G Tsn and Detnet Standardsmentioning

confidence: 99%

See 3 more Smart Citations

A Classification of the Enabling Techniques for Low Latency and Reliable Communications in 5G and Beyond: AI-Enabled Edge Caching

Mutalemwa

Shin

2020

IEEE Access

View full text Add to dashboard Cite

Enhanced conflict‐aware iterated integer linear programming for IEEE 802.1Qbv Time‐Sensitive Network scheduling

Kerem Özkan,

Cevher

2024

Int J Communication

View full text Add to dashboard Cite

SummaryDeterministic communication plays a crucial role for real‐time distributed embedded systems by guaranteeing a low end‐to‐end delay and minimal jitter. Conflict‐aware iterated ILP‐based scheduling (IIS) is an incremental approach to enhance the scalability of single‐shot ILP computation to solve the computationally hard Qbv‐compliant offline scheduling problem for IEEE 802.1 Time‐Sensitive Networking (TSN). Taking into account the conflicting demands of the streams, IIS computes no‐wait schedules by dividing the set of streams into disjoint partitions, each of which is incrementally scheduled by an ILP solver. In this work, defining the no‐wait communication constraints for TSN scheduling, we propose a novel iterated scheduling approach, namely, O‐IIS, with a backtracking mechanism and partial solution support extending the conventional IIS procedure. O‐IIS relies on an ordering strategy to determine the order in which the constructed partitions will be processed by an ILP solver. We evaluate the performance of our approach in terms of schedulability success rate and schedule synthesis time using various network topologies and different partitioning schemes to construct the partitions. The evaluation results show that our approach provides significantly better scheduling performance compared to the existing work in the literature.

show abstract

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

Routing and Scheduling of Time-Triggered Traffic in Time-Sensitive Networks

Cited by 126 publications

References 25 publications

A Classification of the Enabling Techniques for Low Latency and Reliable Communications in 5G and Beyond: AI-Enabled Edge Caching

A Classification of the Enabling Techniques for Low Latency and Reliable Communications in 5G and Beyond: AI-Enabled Edge Caching

Enhanced conflict‐aware iterated integer linear programming for IEEE 802.1Qbv Time‐Sensitive Network scheduling

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

Contact Info

Product

Resources

About