Study of algorithms to define the cabling plan of switched Ethernet for real-time applications

Ethernet networks are being used more and more in industrial environments, but this type of network uses nondeterministic protocols, and thus is not theoretically suitable for the control of real-time applications. However, its transmission rate is considered to be high enough that all the messages can be received within a pre-defined temporal window. In this paper, we propose a method based on the use of spectral algorithms to design the cabling plan of an industrial Ethernet architecture which limits the handling delays of messages inside the time cycle of the application. The topology is based on a two-level hierarchical network with redundant Ethernet links.

[1]  Jurgen Jasperneite,et al.  Analysis of Switched Ethernet Networks with Different Topologies Used in Automation Systems , 1999 .

[2]  M. Fiedler.  A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[3]  H. Simon,et al.  Spectral Nested Dissection 1 , 1992 .

[4]  Shivendra S. Panwar,et al.  Topological Design of Interconnected LAN/MAN Networks , 1993, IEEE J. Sel. Areas Commun..

[5]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[6]  Eduardo Tovar,et al.  Ethernet Goes Real-Time: a Survey on Research and Technological Developments , 2000 .

[7]  A. Hoffman,et al.  Lower bounds for the partitioning of graphs , 1973 .

[8]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

[9]  M. Fiedler.  Eigenvectors of acyclic matrices , 1975 .

[10]  Martine D. F. Schlag,et al.  Spectral K-Way Ratio-Cut Partitioning and Clustering , 1993, 30th ACM/IEEE Design Automation Conference.

[11]  Roy D. Williams,et al.  Performance of dynamic load balancing algorithms for unstructured mesh calculations , 1991, Concurr. Pract. Exp..

[12]  Horst D. Simon,et al.  Partitioning of unstructured problems for parallel processing , 1991 .

[13]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[14]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[15]  Tony F. Chan,et al.  Domain decomposition and multigrid algorithms for elliptic problems on unstructured meshes , 1994 .

[16]  Moshe Sidi,et al.  Topological design of local area networks using genetic algorithms , 1995, Proceedings of INFOCOM'95.

[17]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[18]  Bruce Hendrickson,et al.  A Spectral Algorithm for Seriation and the Consecutive Ones Problem , 1999, SIAM J. Comput..

[19]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[20]  Andrew B. Kahng,et al.  New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[21]  Horst D. Simon,et al.  Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..

[22]  Eduardo Tovar,et al.  CIDER - envisaging a COTS communication infrastructure for evolutionary dependable real-time systems , 2000 .

[23]  P. Torab,et al.  Load analysis of packet switched networks in control systems , 1999, IECON'99. Conference Proceedings. 25th Annual Conference of the IEEE Industrial Electronics Society (Cat. No.99CH37029).

[24]  K. Cooper,et al.  Design and analysis of packet-switched networks for control systems , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

[25]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .