Statistical Analysis of Generalized Processor Sharing Scheduling Discipline

In this paper, we consider the problem of providing statistical guarantees (for example, on the tail distribution of delay) under the Generalized Processor Sharing (GPS) scheduling discipline. This work is motivated by, and is an extension of, Parekh and Gallager's deterministic study of GPS scheduling discipline with leaky-bucket token controlled sessions [PG93a,b, Parekh92]. Using the exponentially bounded burstiness (E.B.B.) process model introduced in [YaSi93a] as a source traffic characterization, we establish results that extend the deterministic study of GPS: for a single GPS server in isolation, we present statistical bounds on the tail distributions of backlog and delay for each session. In the network setting, we show that networks belonging to a broad class of GPS assignments, the so-called Consistent Relative Session Treatment (CRST) GPS assignments, are stable in a stochastic sense. In particular, we establish simple bounds on the tail distribution of backlog and delay for each session in a Rate Proportional Processor Sharing (RPPS) GPS network with arbitrary topology.

[1]  David M. Lucantoni,et al.  A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer Performance , 1986, IEEE J. Sel. Areas Commun..

[2]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[3]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[4]  Gunnar Karlsson,et al.  Performance models of statistical multiplexing in packet video communications , 1988, IEEE Trans. Commun..

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

[6]  S. Jamaloddin Golestani.  A Stop-and-Go Queueing Framework for Congestion Management , 1990, SIGCOMM.

[7]  J. Kingman.  Inequalities in the Theory of Queues , 1970 .

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

[9]  Moshe Sidi,et al.  Generalized Processor Sharing Networks with Exponentially Bounded Burstiness Arrivals , 1994, J. High Speed Networks.

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

[11]  N. Duffield,et al.  Exponential upper bounds via martingales for multiplexers with Markovian arrivals , 1994 .

[12]  Domenico Ferrari,et al.  Rate-controlled static-priority queueing , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[13]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[14]  Don Towsley,et al.  Exponential bounds for a class of stochastic processes with application to call admission control in networks , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[15]  TowsleyDon,et al.  On Per-Session End-to-End Delay and the Call Admission Problem for Real-Time Applications with QOS Requirements , 1994 .

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

[17]  David Clark,et al.  Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism , 1992, SIGCOMM.

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

[19]  Aurel A. Lazar,et al.  Real-Time Scheduling with Quality of Service Constraints , 1991, IEEE J. Sel. Areas Commun..

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

[21]  Paul T. Brady,et al.  A statistical analysis of on-off patterns in 16 conversations , 1968 .

[22]  K ParekhAbhay,et al.  A generalized processor sharing approach to flow control in integrated services networks , 1993 .

[23]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

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

[25]  D.C. Verma,et al.  Delay jitter control for real-time communication in a packet switching network , 1991, Proceedings of TRICOMM `91: IEEE Conference on Communications Software: Communications for Distributed Applications and Systems.

[26]  Jim Kurose,et al.  Statistical analysis of generalized processor sharing scheduling discipline , 1994, SIGCOMM 1994.

[27]  S. Jamaloddin Golestani.  Duration-limited statistical multiplexing of delay-sensitive traffic in packet networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[28]  Srinivasan Keshav,et al.  Rate controlled servers for very high-speed networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

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