Statistical per-flow service bounds in a network with aggregate provisioning

Scalability concerns of QoS implementations have stipulated service architectures where QoS is not provisioned separately to each flow, but instead to aggregates of flows. This paper determines stochastic bounds for the service experienced by a single flow when resources are managed for aggregates of flows and when the scheduling algorithms used in the network are not known. Using a recently developed statistical network calculus, per-flow bounds can be calculated for backlog, delay, and the burstiness of output traffic.

[1]  Jean-Yves Le Boudec,et al.  Network Calculus , 2001, Lecture Notes in Computer Science.

[2]  Yiwei Thomas Hou,et al.  Fundamental trade-offs in aggregate packet scheduling , 2005, IEEE Transactions on Parallel and Distributed Systems.

[3]  H. Saunders,et al.  Probability, Random Variables and Stochastic Processes (2nd Edition) , 1989 .

[4]  Athanasios Papoulis,et al.  Probability, Random Variables and Stochastic Processes , 1965 .

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

[6]  R. Agrawal,et al.  Performance Bounds for Flow Control Protocols 1 , 1998 .

[7]  F. Kelly,et al.  Stochastic networks : theory and applications , 1996 .

[8]  Wilton R. Abbott,et al.  Network Calculus , 1970 .

[9]  Jean-Yves Le Boudec,et al.  On Probabilistic Network Calculus , 2002 .

[10]  Jean-Yves Le Boudec,et al.  Bounds for independent regulated inputs multiplexed in a service curve network element , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[11]  Don Towsley,et al.  Theories and models for Internet quality of service , 2002, Proc. IEEE.

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

[13]  Chaiwat Oottamakorn,et al.  Statistical service assurances for traffic scheduling algorithms , 2000, IEEE Journal on Selected Areas in Communications.

[14]  Debasis Mitra,et al.  A New Approach for Allocating Buffers and Bandwidth to Heterogeneous Regulated Traffic in an ATM Node , 1995, IEEE J. Sel. Areas Commun..

[15]  Matthew Andrews,et al.  Instability of FIFO in session-oriented networks , 2000, SODA '00.

[16]  Allan Borodin,et al.  Adversarial queuing theory , 2001, JACM.

[17]  Cheng-Shang Chang,et al.  On the performance of multiplexing independent regulated inputs , 2001, SIGMETRICS '01.

[18]  Jean-Yves Le Boudec,et al.  Application of Network Calculus to Guaranteed Service Networks , 1998, IEEE Trans. Inf. Theory.

[19]  Richard G. Baraniuk,et al.  Simulation of nonGaussian long-range-dependent traffic using wavelets , 1999, SIGMETRICS '99.

[20]  Rene L. Cruz,et al.  SCED+: efficient management of quality of service guarantees , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[21]  Frank Kelly,et al.  Notes on effective bandwidths , 1994 .

[22]  Leandros Tassiulas,et al.  Any work-conserving policy stabilizes the ring with spatial re-use , 1996, TNET.

[23]  George Kesidis,et al.  Extremal Traffic and Worst-Case Performance for Queues with Shaped Arrivals , 1998 .

[24]  Jean-Yves Le Boudec,et al.  Delay Bounds in a Network with Aggregate Scheduling , 2000, QofIS.

[25]  Almut Burchard,et al.  A Calculus for End-to-end Statistical Service Guarantees , 2002, ArXiv.