Methodology for the QoS characterization in High Constraints Industrial Networks

2014 ◽  
Vol 2014 (1) ◽  
pp. 30-41
Author(s):  
Josu Bilbao ◽  
◽  
Cristina Cruces ◽  
Igor Armendariz ◽  
◽  
...  
Keyword(s):  
Industrial Networks

Supply voltage quality in low voltage industrial networks of Estonia

2011 ◽  
Vol 18 (2) ◽  
pp. 102 ◽  
Author(s):  
T Vinnal ◽  
K Janson ◽  
J Järvik ◽  
H Kalda ◽  
T Sakkos
Keyword(s):  
Low Voltage ◽  
Supply Voltage ◽  
Industrial Networks ◽  
Voltage Quality

Market Embeddedness and Corporate Instability: The Ecology of Inter-industrial Networks

1997 ◽  
Vol 26 (4) ◽  
pp. 419-441 ◽  
Author(s):  
Ilan Talmud ◽  
Gustavo S. Mesch
Keyword(s):  
Industrial Networks

Logger and Analyser for Modbus-based Industrial Networks

2020 ◽  
Author(s):  
Daniel Marian Nicolescu ◽  
Razvan Tataroiu ◽  
Dumitru Cristian Tranca ◽  
George Cristian Patru
Keyword(s):  
Industrial Networks

scholarly journals Reliability-Aware Multipath Routing of Time-Triggered Traffic in Time-Sensitive Networks

Electronics ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 125
Author(s):  
Kai Huang ◽  
Xinming Wan ◽  
Ke Wang ◽  
Xiaowen Jiang ◽  
Junjian Chen ◽  
...  
Keyword(s):  
Fault Tolerance ◽  
High Reliability ◽  
Multipath Routing ◽  
Shortest Path Routing ◽  
Industrial Networks ◽  
Negative Effect ◽  
Routing Method ◽  
No Wait ◽  
Spatial Redundancy ◽  
Unreliable Links

With the development of industrial networks, the demands for strict timing requirements and high reliability in transmission become more essential, which promote the establishment of a Time-Sensitive Network (TSN). TSN is a set of standards with the intention of extending Ethernet for safety-critical and real-time applications. In general, frame replication is used to achieve fault-tolerance, while the increased load has a negative effect on the schedule synthesis phase. It is necessary to consider schedulability and reliability jointly. In this paper, a heuristic-based routing method is proposed to achieve fault tolerance by spatial redundancy for TSNs containing unreliable links. A cost function is presented to evaluate each routing set, and a heuristic algorithm is applied to find the solution with higher schedulability. Compared to the shortest path routing, our method can improve the reliability and the success rate of no-wait scheduling by 5–15% depending on the scale of topology.

Sign in / Sign up

Export Citation Format

Share Document