A longest path problem for evaluating the worst case packet delay of switched ethernet

Date

2010-07-09

Author

Schmidt, Klaus Verner
Schmidt, Şenan Ece

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

5
views

0
downloads

In the recent years, the use of real-time Ethernet protocols becomes more and more relevant for time-critical networked industrial applications. In this context, this paper presents a method to compute the worst-case packet delays on switched Ethernet. Based on an evaluation of the packet delays at each switch port and the network topology, we construct a weighted directed graph that allows to find the worst-case end-to-end packet delay by solving a conventional longest-path problem.

Subject Keywords

Switches, Delay, Ethernet networks, Nickel, Real time systems, Topology, Network topology

URI

https://hdl.handle.net/11511/38519

DOI

https://doi.org/10.1109/sies.2010.5551398

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Citation Formats

K. V. Schmidt and Ş. E. Schmidt, “A longest path problem for evaluating the worst case packet delay of switched ethernet,” 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38519.