Effective envelopes: statistical bounds on multiplexed traffic in packet networks

A statistical network service which allows a certain fraction of traffic to not meet its QoS guarantees can extract additional capacity from a network by exploiting the statistical properties of the traffic. Here we consider a statistical service which assumes statistical independence of flows, but does not make any assumptions on the statistics of traffic sources, other than that they are regulated, e.g., by a leaky bucket. Under these conditions, we present functions, so-called local effective envelopes and global effective envelopes, which are, with high certainty, upper bounds of multiplexed traffic. We show that these envelopes can be used to obtain bounds on the amount of traffic on a link that can be provisioned with statistical QoS. A key advantage of our bounds is that they can be applied with a variety of scheduling algorithms. In fact, we show that one can reuse existing admission control functions that are available for scheduling algorithms with a deterministic service. We present numerical examples which compare the number of flows with statistical QoS guarantees that can be admitted with our effective envelope approach to those achieved with existing methods.

[1]  Debasis Mitra,et al.  Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes , 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).

[2]  Keith W. Ross,et al.  Packet multiplexers with adversarial regulated traffic , 2002, Comput. Commun..

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

[4]  Keith W. Ross,et al.  Guaranteeing statistical QoS to regulated traffic: the single node case , 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).

[5]  Nick G. Duffield,et al.  The cost of quality in networks of aggregate traffic , 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.

[6]  George Kesidis,et al.  Extremal shape-controlled traffic patterns in high-speed networks , 2000, IEEE Trans. Commun..

[7]  E. Parzen.  1. Random Variables and Stochastic Processes , 1999 .

[8]  Ness B. Shroff,et al.  Admission control for statistical QoS: theory and practice , 1999, IEEE Netw..

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

[10]  Edward W. Knightly.  Enforceable quality of service guarantees for bursty traffic streams , 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.

[11]  Boorstyn Robert,et al.  Statistical Multiplexing Gain of Link Scheduling Algorithms in QoS Networks , 1999 .

[12]  Ness B. Shroff,et al.  A central-limit-theorem-based approach for analyzing queue behavior in high-speed networks , 1998, TNET.

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

[14]  Mukesh Taneja.  A service curve approach for quality of service management in integrated services networks , 1998 .

[15]  B. T. Doshi.  Rule based traffic descriptors for ATM/B-ISDN , 1994, Proceedings of MILCOM '94.

[16]  Philippe Oechslin,et al.  On-Off Sources and Worst Case Arrival Patterns of the Leaky Bucket , 1997 .

[17]  Domenico Ferrari,et al.  Exact admission control for networks with a bounded delay service , 1996, TNET.

[18]  Domenico Ferrari,et al.  Rate-Controlled Service Disciplines , 1994, J. High Speed Networks.

[19]  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..

[20]  Edward W. Knightly,et al.  Deterministic delay bounds for VBR video in packet-switching networks: fundamental limits and practical trade-offs , 1996, TNET.

[21]  Keith W. Ross,et al.  Guaranteeing statistical QoS to regulated traffic: the multiple node case , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

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

[23]  Edward W. Knightly,et al.  H-BIND: a new approach to providing statistical performance guarantees to VBR traffic , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

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

[25]  Julio A. Garceran.  A New Approach for Allocating Buffers and Bandwidth to Heterogeneous , Regulated Traffic in an ATM Node ” , 2022 .

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

[27]  James F. Kurose,et al.  On computing per-session performance bounds in high-speed multi-hop computer networks , 1992, SIGMETRICS '92/PERFORMANCE '92.

[28]  Donald F. Towsley,et al.  Source time scale and optimal buffer/bandwidth trade-off for regulated traffic in an ATM node , 1997, Proceedings of INFOCOM '97.