A systematic approach for providing end-to-end probabilistic QoS guarantees

We propose a probabilistic characterization of network traffic. This characterization can handle traffic with heavy-tailed distributions in performance analysis. We show that queue size, output traffic, virtual delay, aggregate traffic, etc. at various points in a network can easily be characterized within the framework. This characterization is measurable and allows for a simple probabilistic method for regulating network traffic. All of these properties of the proposed characterization enable a systematic approach for providing end-to-end probabilistic QoS guarantees

[1]  Cheng-Shang Chang,et al.  Stability, queue length, and delay of deterministic and stochastic queueing networks , 1994, IEEE Trans. Autom. Control..

[2]  Ilkka Norros,et al.  A storage model with self-similar input , 1994, Queueing Syst. Theory Appl..

[3]  Rene L. Cruz,et al.  Quality of Service Guarantees in Virtual Circuit Switched Networks , 1995, IEEE J. Sel. Areas Commun..

[4]  George C. Polyzos,et al.  A service-curve approach to performance guarantees in integrated-service networks , 1996 .

[5]  Yuming Jiang,et al.  Analysis on generalized stochastically bounded bursty traffic for communication networks , 2002, 27th Annual IEEE Conference on Local Computer Networks, 2002. Proceedings. LCN 2002..

[6]  Moshe Sidi,et al.  Performance and stability of communication networks via robust exponential bounds , 1993, TNET.

[7]  Jean-Yves Le Boudec,et al.  Network Calculus: A Theory of Deterministic Queuing Systems for the Internet , 2001 .

[8]  San-qi Li,et al.  Probabilistic Burstiness-Curve-Based Connection Control for Real-Time Multimedia Services in ATM Networks , 1997, IEEE J. Sel. Areas Commun..

[9]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[10]  Moshe Sidi,et al.  Stochastically bounded burstiness for communication networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[11]  Cheng-Shang Chang,et al.  Performance guarantees in communication networks , 2000, Eur. Trans. Telecommun..

[12]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[13]  Nicolas D. Georganas,et al.  Self-Similar Traffic and Upper Bounds to Buffer-Overflow Probability in an ATM Queue , 1998, Perform. Evaluation.

[14]  Walter Willinger,et al.  Self-Similar Network Traffic and Performance Evaluation , 2000 .

[15]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[16]  Mark A. McComb.  Comparison Methods for Stochastic Models and Risks , 2003, Technometrics.

[17]  Dinesh C. Verma,et al.  A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..

[18]  Wu-chun Feng,et al.  A Deterministic Characterization of Network TraÆc for Average Performance Guarantees , 2022 .

[19]  Jon Crowcroft,et al.  Analysis of Burstiness and Jitter in Real-Time Communications , 1993, SIGCOMM.