Novel techniques for the design and control of generalized processor sharing schedulers for multiple QoS classes

Generalized processor sharing (GPS) is a scheduling discipline which provides minimum service guarantees as well as fair resource sharing. The performance of GPS is governed by the scheduling weights associated with individual connections. We address the design of the GPS weights, along with the related connection admission control (CAC). Our main goal is to achieve statistical multiplexing gains in the presence of multiple traffic and quality-of-service (QoS) classes of connections that share a common trunk. We present novel techniques to compute and adapt the weights. We also characterize the capacity region of the system, and propose a natural CAC procedure. Numerical results on 2-class and 3-class examples demonstrate the effectiveness of our methods.

[1]  Keith W. Ross,et al.  Packet multiplexers with adversarial regulated traffic , 2002, 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.

[2]  James A. Bucklew,et al.  Large Deviation Techniques in Decision, Simulation, and Estimation , 1990 .

[3]  Alan Weiss,et al.  Large Deviations For Performance Analysis: Queues, Communication and Computing , 1995 .

[4]  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).

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

[6]  Debasis Mitra,et al.  Performance and fluid simulations of a novel shared buffer management system , 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.

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

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

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

[10]  D. Stiliadis,et al.  Rate-proportional servers: a design methodology for fair queueing algorithms , 1998, TNET.

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

[12]  Frank E. Grubbs,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[13]  George Kesidis.  ATM Network Performance , 1996, Springer US.

[14]  Debasis Mitra,et al.  Virtual Partitioning by Dynamic Priorities: Fair and Efficient Resource-Sharing by Several Services , 1996, International Zurich Seminar on Digital Communications.

[15]  Srinivasan Keshav,et al.  An Engineering Approach to Computer Networking: ATM Networks , 1996 .

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