A Longest-Path Problem for Evaluating the Worst-Case Packet Delay of Switched Ethernet
Loading...
Date
2010
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Top 10%
Popularity
Average
Abstract
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-toend packet delay by solving a conventional longest-path problem. © 2010 IEEE.
Description
Keywords
Fields of Science
0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Citation
Schmidt, Klaus Werner; Schmidt, E.G, "A Longest-Path Problem for Evaluating the Worst-Case Packet Delay of Switched Ethernet", 2010 International Symposium On Industrial Embedded Systems, Sies 2010 - Conference Proceedings, pp. 205-208, (2010).
WoS Q
Scopus Q
OpenCitations Citation Count
5
Source
2010 International Symposium on Industrial Embedded Systems, SIES 2010 - Conference Proceedings -- 5th International Symposium on Industrial Embedded Systems, SIES 2010 -- 7 July 2010 through 9 July 2010 -- Trento -- 81781
Volume
Issue
Start Page
205
End Page
208
PlumX Metrics
Citations
CrossRef : 3
Scopus : 12
Captures
Mendeley Readers : 6
SCOPUS™ Citations
12
checked on Feb 23, 2026
Page Views
2
checked on Feb 23, 2026
Google Scholar™
