Abstract
A switched Ethernet network needs a worst-case delay analysis to prove that real-time applications can be correctly implemented on it. Existing approaches for upper bounding end-to-end delay assume that there is either no-synchronization or a global synchronization of flows which needs a global clock. Conversely, flows emitted by the same end-system can be easily synchronized using the existing local clock. This paper explains how the partial synchronization of periodic flows can be integrated in the worst-case delay analysis provided by Network Calculus approach. End-to-end delays computed on switched Ethernet configurations show that the proposed method clearly reduces the upper bounds of end-to-end delay.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cruz, R.: A Calculus for Network Delay, part 1, part 2. Trans. Inf. Theory. 37, 114–141 (1991)
Le Boudec, J.-Y.: Application of Network Calculus To Guaranteed Service Networks. Trans. Inf. Theory. 44, 1087–1096 (1998)
Le Boudec, J.-Y., Patrick, T.: Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. Springer, Heidelberg (2001)
Martin, S., Minet, P.: Schedulability Analysis of Flows Scheduled With FIFO: Application To the Expedited Forwarding Class. In: IPDPS 2006, Rhodes Island, pp. 8–15 (2006)
Cholvi, V., Echague, J., Le Boudec, J.-Y.: On the Feasible Scenarios at the Output of a FIFO Server. IEEE Communication Letters 9 (2005)
Loeser, J., Haertig, H.: Low-Latency Hard Real-Time Communication over Switched Ethernet. In: ECRTS 2004, Catania, Italy, pp. 13–22 (2004)
Charara, H., Scharbarg, J.-L., Ermont, J., Fraboul, C.: Method for Bounding End-to-End Delays on an AFDX Network. In: ECRTS 2006, Dresden, Germany, pp. 192–202 (2006)
Goossens, J.: Scheduling of Offset Free Systems. J. Real-Time Systems 24, 239–258 (2003)
Grenier, M., Goossens, J., Navet, N.: Near-optimal Fixed Priority Preemptive Scheduling of Offset Free Systems. In: RTNS 2006, Poitiers, France (2006)
Grenier, M., Havet, L., Navet, N.: Pushing the Limits of CAN - Scheduling Frames with Offsets Provides a Major Performance Boost. In: 4th European Congress on Embedded Real Time Software, Toulouse, France (2008)
Jasperneite, J., Neumann, P., Theis, M., Watson, K.: Deterministic Real-Time Communication with Switched Ethernet. In: WFCS 2002, Vsters, Sweden, pp. 11–18 (2002)
Georges, J.P., Rondeau, E., Divoux, T.: Evaluation of Switched Ethernet in an Industrial Context by Using Network Calculus. In: WFCS 2002, Vsters, Sweden, pp. 19–26 (2002)
Fan, X., Jonsson, M., Jonsson, J.: Guaranteed Real-Time Communication in Packet-Switched Networks with FCFS Queuing. J. The International Journal of Computer and Telecommunications Networking 53, 400–417 (2009)
Adnan, M., Scharbarg, J.-L., Ermont, J., Fraboul, C.: Model for Worst Case Delay Analysis of an AFDX Network using Timed Automata. In: WiP, ETFA 2010, Bilbao, Spain (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, X., Scharbarg, JL., Fraboul, C. (2010). Partially Synchronizing Periodic Flows with Offsets Improves Worst-Case End-to-End Delay Analysis of Switched Ethernet. In: Margaria, T., Steffen, B. (eds) Leveraging Applications of Formal Methods, Verification, and Validation. ISoLA 2010. Lecture Notes in Computer Science, vol 6415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16558-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-16558-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16557-3
Online ISBN: 978-3-642-16558-0
eBook Packages: Computer ScienceComputer Science (R0)