Fault-Resilient Topology Planning and Traffic Configuration for IEEE 802.1Qbv TSN Networks

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

doi:10.1109/iolts.2018.8474201

Cited by 35 publications

(17 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many research works have been conducted targeting a specific feature of IEEE TSN standards, including fault tolerance [27][28][29], traffic planning and shaping [30][31][32][33], and time synchronization [26,34]. However, it is important to mention that in this section, we only highlighted some selected references and did not intend to present an exhaustive survey of the broad and vast TSN research domain.…”

Section: Related Workmentioning

confidence: 99%

Future Industrial Networks in Process Automation: Goals, Challenges, and Future Directions

Åkerberg

Åkesson²,

Gade

et al. 2021

Applied Sciences

View full text Add to dashboard Cite

There are many initiatives and technologies working towards implementing factories of the future. One consensus is that the classical hierarchical automation system design needs to be flattened while supporting the functionality of both Operation Technology (OT) and Information Technology (IT) within the same network infrastructure. To achieve the goal of IT/OT convergence in process automation, an evolutionary transition is preferred. Challenges are foreseen during the transition, mainly caused by the traditional automation architecture, and the main challenge is to identify the gap between the current and future network architectures. To address the challenges, in this paper, we describe one desired future scenario for process automation and carry out traffic measurements from a pulp and paper mill. The measured traffic is further analyzed, which reveals representative traffic characteristics in the process automation. Finally, the key challenges and future directions towards a system architecture for factories of the future are presented.

show abstract

Section: Related Workmentioning

confidence: 99%

Future Industrial Networks in Process Automation: Goals, Challenges, and Future Directions

Åkerberg

Åkesson²,

Gade

et al. 2021

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…al in [51] increase the flexibility of the scheduling by employing a greedybased heuristic approach which is less resource demanding, and possible to be implemented on industrial equipment on the field floor. The greedy-based heuristic approach is also proposed in [52], where authors aim to generate joint network routing and communication scheduling that are fault-tolerant, within a reasonably short time. Arestova et al in [53] propose a hybrid genetic algorithm for the communication scheduling and network routing to find a near-optimal solution in a reasonable time, and also optimizing the bandwidth to let more less-critical traffic transmitted.…”

Section: Related Workmentioning

confidence: 99%

Communication Scheduling for Control Performance in TSN-Based Fog Computing Platforms

Barzegaran

Pop

2021

IEEE Access

View full text Add to dashboard Cite

show abstract

“…In recent studies, some works [22,23] extended the routing problem to the topology planning problem. While in practical applications, the greater demand is to find the best routing scheme based on the given topology.…”

Section: Related Workmentioning

confidence: 99%

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

Huang

Jiang

et al. 2020

Electronics

View full text Add to dashboard Cite

The IEEE 802.1Qbv standard provides deterministic delay and low jitter guarantee for time-critical communication using a precomputed cyclic transmission schedule. Computing such transmission schedule requires routing the flows first, which significantly affects the quality of the schedule. So far off-the-shelf algorithms like load-balanced routing, which minimize the maximum scheduled traffic load (MSTL), have been used to accommodate more time-triggered traffic. However, they do not consider that the bandwidth utilization of periodic flows is decentralized and their criteria for bottleneck of scheduling are imprecise. In this paper, we firstly explore the combinability among different periods of flows, which can measure their ability to share bandwidth without conflict. Then, we propose a novel period-aware routing algorithm to reduce the scheduling bottleneck, thus more flows can be accommodated. The experiment results show that the success rate of scheduling is significantly improved compared to shortest path routing and load balanced routing.

show abstract

Fault-Resilient Topology Planning and Traffic Configuration for IEEE 802.1Qbv TSN Networks

Cited by 35 publications

References 6 publications

Future Industrial Networks in Process Automation: Goals, Challenges, and Future Directions

Future Industrial Networks in Process Automation: Goals, Challenges, and Future Directions

Communication Scheduling for Control Performance in TSN-Based Fog Computing Platforms

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

Contact Info

Product

Resources

About