IEEE/ACM Transactions on Networking (TON)
Holistic schedulability analysis for distributed hard real-time systems
Microprocessing and Microprogramming - Parallel processing in embedded real-time systems
Delay Bounds in a Network with Aggregate Scheduling
QofIS '00 Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services
Resource Allocation and Admission Control Styles in QoS DiffServ Networks
QoS-IP '01 Proceedings of the International Workshop on Quality of Service in Multiservice IP Networks
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Applying and optimizing Trajectory approach for performance evaluation of AFDX avionics network
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Worst-case end-to-end delay analysis of an avionics AFDX network
Proceedings of the Conference on Design, Automation and Test in Europe
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Optimal design of virtual links in AFDX networks
Real-Time Systems
Hi-index | 0.00 |
In this paper, we are interested in real-time flows requiring quantitative and deterministic QoS (Quality of Service) guarantees. We focus more particularly on two QoS parameters: the worst case end-to-end response time and jitter. We consider a FIFO (First In First Out) scheduling of flows. The FIFO scheduling is the simplest one to implement and very used. We first establish a bound on the worst case end-to-end response time of any flow in the network, using the trajectory approach. We present an example illustrating our results. Finally, we show how to apply these results to the EF (Expedited Forwarding) class in a DiffServ (Differentiated Services) architecture.