Deterministic and probabilistic QoS guarantees for real-time traffics in a DiffServ/MPLS architecture

In this paper, we focus on the quantitative quality of service (QoS) guarantee in a differentiated services (DiffServ) domain that can be granted to an expedited forwarding (EF) flow in terms of end-to-end delay. This study shows that delays much smaller than the deterministic bound can be guaranteed with probabilities close to one. An admission control derived from these results is then proposed, providing a probabilistic QoS guarantee to EF flows.

[1]  John A. Clark,et al.  Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.

[2]  Alexandre Proutière,et al.  Statistical performance guarantees for streaming flows using expedited forwarding , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[3]  Sanjoy K. Baruah,et al.  Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor , 1990, Real-Time Systems.

[4]  Leila Azouz Saidane,et al.  Deterministic and probabilistic QoS guarantees for the EF class in a DiffServ/MPLS domain , 2005 .

[5]  Jean-Yves Le Boudec,et al.  Delay jitter bounds and packet scale rate guarantee for expedited forwarding , 2002, TNET.

[6]  Jean-Yves Le Boudec,et al.  Delay jitter bounds and packet scale rate guarantee for expedited forwarding , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).