Bandwidth allocation for multiple qualities of service using generalized processor sharing

We consider the asymptotic behavior of the queue length distribution in segregated buffers sharing a deterministic server via a class of generalized processor sharing (GPS) policies. Such policies have been proposed as a means to guarantee individual quality of service constraints to heterogeneous streams in integrated services digital networks. These results exhibit the manner in which spare capacity is shared by statistically multiplexed traffic streams. The framework corresponds to a natural relaxation of a single GPS node subject to (/spl sigma/, /spl rho/)-constrained flows where, instead of studying the worst case behavior, we consider statistical bounds on the performance of individual traffic streams.

[1]  R. M. Loynes,et al.  The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[2]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[3]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[4]  Frank P. Kelly,et al.  Effective bandwidths at multi-class queues , 1991, Queueing Syst. Theory Appl..

[5]  Richard J. Gibbens,et al.  Effective bandwidths for the multi-type UAS channel , 1991, Queueing Syst. Theory Appl..

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

[7]  A.E. Eckberg,et al.  B-ISDN/ATM traffic and congestion control , 1992, IEEE Network.

[8]  H. Gilbert,et al.  Traffic management for B-ISDN services , 1992, IEEE Network.

[9]  Roch Guérin,et al.  A unified approach to bandwidth allocation and access control in fast packet-switched networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[10]  Cheng-Shang Chang.  Stability, Queue Length and Delay, Part 11: Stochastic Queueing Networks , 1992 .

[11]  Bharat T. Doshi,et al.  Deterministic rule based traffic descriptors for broadband ISDN: worst case behavior and connection acceptance control , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[12]  Jean C. Walrand,et al.  Effective bandwidths for multiclass Markov fluids and other ATM sources , 1993, TNET.

[13]  Debasis Mitra,et al.  Effective bandwidth of general Markovian traffic sources and admission control of high speed networks , 1993, TNET.

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

[15]  Ward Whitt,et al.  Tail probabilities with statistical multiplexing and effective bandwidths in multi-class queues , 1993, Telecommun. Syst..

[16]  Kotikalapudi Sriram.  Methodologies for Bandwidth Allocation, Transmission Scheduling, and Congestion Avoidance in Broadband ATM Networks , 1993, Comput. Networks ISDN Syst..

[17]  Jean C. Walrand,et al.  Decoupling bandwidths for networks: a decomposition approach to resource management , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[18]  Moshe Sidi,et al.  Generalized processor sharing networks with exponentially bounded burstiness arrivals , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[19]  Jean C. Walrand,et al.  Effective bandwidths: Call admission, traffic policing and filtering for ATM networks , 1995, Queueing Syst. Theory Appl..

[20]  Donald F. Towsley,et al.  Statistical Analysis of Generalized Processor Sharing Scheduling Discipline , 1995, IEEE J. Sel. Areas Commun..