The Annals of Applied Probability

The heavy traffic limit of an unbalanced generalized processor sharing model

Kavita Ramanan and Martin I. Reiman

Full-text: Open access

Abstract

This work considers a server that processes J classes using the generalized processor sharing discipline with base weight vector α=(α1, …, αJ) and redistribution weight vector β=(β1, …, βJ). The invariant manifold $\mathcal{M}$ of the so-called fluid limit associated with this model is shown to have the form $\mathcal{M}=\{x\in\mathbb{R}_{+}^{J}:x_{j}=0\mbox{ for }j\in\mathcal{S}\}$, where $\mathcal{S}$ is the set of strictly subcritical classes, which is identified explicitly in terms of the vectors α and β and the long-run average work arrival rates γj of each class j. In addition, under general assumptions, it is shown that when the heavy traffic condition ∑j=1Jγj=∑j=1Jαj holds, the functional central limit of the scaled unfinished work process is a reflected diffusion process that lies in $\mathcal{M}$. The reflected diffusion limit is characterized by the so-called extended Skorokhod map and may fail to be a semimartingale. This generalizes earlier results obtained for the simpler, balanced case where γj=αj for j=1, …, J, in which case $\mathcal{M}=\mathbb{R}_{+}^{J}$ and there is no state-space collapse. Standard techniques for obtaining diffusion approximations cannot be applied in the unbalanced case due to the particular structure of the GPS model. Along the way, this work also establishes a comparison principle for solutions to the extended Skorokhod map associated with this model, which may be of independent interest.

Article information

Source
Ann. Appl. Probab., Volume 18, Number 1 (2008), 22-58.

Dates
First available in Project Euclid: 9 January 2008

Permanent link to this document
https://projecteuclid.org/euclid.aoap/1199890014

Digital Object Identifier
doi:10.1214/07-AAP438

Mathematical Reviews number (MathSciNet)
MR2380890

Zentralblatt MATH identifier
1144.60056

Subjects
Primary: 60F05: Central limit and other weak theorems 60F17: Functional limit theorems; invariance principles
Secondary: 60K25: Queueing theory [See also 68M20, 90B22] 90B22: Queues and service [See also 60K25, 68M20] 68M20: Performance evaluation; queueing; scheduling [See also 60K25, 90Bxx]

Keywords
Heavy traffic diffusion approximations generalized processor sharing fluid limits invariant manifold state space collapse queueing networks Skorokhod problem Skorokhod map extended Skorokhod problem nonsemimartingale comparison principle

Citation

Ramanan, Kavita; Reiman, Martin I. The heavy traffic limit of an unbalanced generalized processor sharing model. Ann. Appl. Probab. 18 (2008), no. 1, 22--58. doi:10.1214/07-AAP438. https://projecteuclid.org/euclid.aoap/1199890014


Export citation

References

  • Borst, S., Mandjes, M. and van Uitert, M. (2003). Generalized processor sharing with light-tailed and heavy-tailed input. IEEE/ACM Trans. on Net. 11 821–834.
  • Bramson, M. (1998). State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Systems 30 89–148.
  • Budhiraja, A. and Dupuis, P. (1999). Simple necessary and sufficient conditions for the stability of constrained processes. SIAM J. Appl. Math. 59 1686–1700.
  • Chen, H. and Mandelbaum, A. (1991). Stochastic discrete flow networks: Diffusion networks and bottlenecks. Ann. Probab. 19 1463–1519.
  • Chen, H. and Yao, D. (2001). Fundamentals of Queueing Networks. Springer, Berlin.
  • Dupuis, P. and Ishii, H. (1991). On Lipschitz continuity of the solution mapping to the Skorokhod problem, with applications. Stochastics 35 31–62.
  • Dupuis, P. and Ramanan, K. (1998). A Skorokhod problem formulation and large deviation analysis of a processor sharing model. Queueing Systems 28 109–124.
  • Dupuis, P. and Ramanan, K. (1999). Convex duality and the Skorokhod problem. I. Probab. Theory Related Fields 115 197–236.
  • Dupuis, P. and Ramanan, K. (2000). A multiclass feeback queueing network with a regular Skorokhod problem. Queueing Systems 36 327–349.
  • Ethier, S. N. and Kurtz, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley, New York.
  • Harrison, J. M. and Reiman, M. I. (1981). Reflected Brownian motion on an orthant. Ann. Probab. 9 302–308.
  • Karatzas, I. and Shreve, S. (1991). Brownian Motion and Stochastic Calculus, 2nd ed. Springer, New York.
  • Kelly, F. P. and Williams, R. J. (2004). Fluid model for a network operating under a fair bandwidth-sharing policy. Ann. Appl. Probab. 14 1055–1083.
  • Kruk, L. Lehoczky, J. Ramanan, K. and Shreve, S. (2007). An explicit formula for doubly reflected processes on [0,a]. Ann. Probab. 35 1740–1768.
  • Peterson, W. P. (1991). A heavy traffic limit theorem for networks of queues with multiple customer types. Math. Oper. Res. 16 90–118.
  • Ramanan, K. (2006). Reflected diffusions defined via the extended Skorokhod map. Electron. J. Probab. 11 934–992.
  • Ramanan, K. and Reiman, M. I. (2003). Fluid and heavy traffic diffusion limits for a generalized processor sharing model. Ann. Appl. Probab. 13 100–139.
  • Ramasubramanian, S. (2000). A subsidy-surplus model and the Skorokhod problem in an orthant. Math. Oper. Res. 25 509–538.
  • Reiman, M. I. (1984). Open queueing networks in heavy traffic. Math. Oper. Res. 9 441–458.
  • Whitt, W. (2002). An Introduction to Stochastic-Process Limits and Their Application to Queues. Springer, Berlin.
  • Williams, R. J. (1998). Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse. Queueing Systems 30 27–88.
  • Zhang, T. S. (1994). On the strong solutions of one dimensional stochastic differential equations with reflecting boundary. Stoch. Proc. Appl. 50 135–147.