Scheduling of Offset Free Systems
Real-Time Systems
Low-Latency Hard Real-Time Communication over Switched Ethernet
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Methods for bounding end-to-end delays on an AFDX network
ECRTS '06 Proceedings of the 18th Euromicro Conference on Real-Time Systems
Guaranteed real-time communication in packet-switched networks with FCFS queuing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Schedulability analysis of flows scheduled with FIFO: application to the expedited forwarding class
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Application of network calculus to guaranteed service networks
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
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.