Abstract
We consider a system of parallel queues with Poisson arrivals and exponentially distributed service requirements. The various queues are coupled through their service rates, causing a complex dynamic interaction. Specifically, the system consists of one primary queue and several secondary queues whose service rates depend on whether the primary queue is empty or not. Conversely, the service rate of the primary queue depends on which of the secondary queues are empty.
An important special case arises when the service rates satisfy a specific relationship so that the various queues form a work-conserving system. This case is, in fact, equivalent to a so-called Generalized Processor Sharing (GPS) system. GPS-based scheduling algorithms have emerged as popular mechanisms for achieving service differentiation while providing statistical multiplexing gains.
We consider a heavy-traffic scenario, and assume that each of the secondary queues is underloaded when the primary queue is busy. Using a perturbation procedure, we derive the lowest-order asymptotic approximation to the joint stationary distribution of the queue lengths, in terms of a small positive parameter measuring the closeness of the system to instability. Heuristic derivations of these results are presented.
We also pursue two extensions: (i) the more general work-conserving case where the service rate of a secondary queue may depend on its own length, and is a slowly varying function of the length of the primary queue; and (ii) the non-work-conserving case where the service rate of a secondary queue may depend on its own length, but not on the length of the primary queue.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bertsimas, D., Paschalidis, I.Ch., Tsitsiklis, J.N.: Large deviations analysis of the generalized processor sharing policy. Queueing Syst. 32, 319–349 (1999)
Borst, S.C., Boxma, O.J., Jelenković, P.R.: Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows. Queueing Syst. 43, 273–306 (2003)
Borst, S.C., Boxma, O.J., Van Uitert, M.J.G.: The asymptotic workload behavior of two coupled queues. Queueing Syst. 43, 81–102 (2003)
Borst, S.C., Mandjes, M.R.H., Van Uitert, M.J.G.: Generalized processor sharing queues with heterogeneous traffic classes. Adv. Appl. Probab. 35, 806–845 (2003)
Cohen, J.W., Boxma, O.J.: Boundary Value Problems in Queueing System Analysis. North-Holland, Amsterdam (1983)
Dai, J.G.: On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Ann. Appl. Probab. 5, 49–77 (1995)
Elwalid, A., Mitra, D.: Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes. In: Proc. IEEE Infocom ’99, New York, USA, pp. 1220–1230 (1999)
Fayolle, G., Iasnogorodski, R.: Two coupled processors: the reduction to a Riemann–Hilbert problem. Z. Wahrscheinlichkeitstheor. Verw. Geb. 47, 325–351 (1979)
Guillemin, F., Mazumdar, R.R., Dupuis, A., Boyer, J.: Analysis of the fluid weighted fair queueing system. J. Appl. Probab. 40, 180–199 (2003)
Guillemin, F., Pinchon, D.: Analysis of generalized processor-sharing systems with two classes of customers and exponential services. J. Appl. Probab. 41, 832–858 (2004)
Kelly, F.P.: Reversibility and Stochastic Networks. Wiley, Chichester (1979)
Knessl, C., Morrison, J.A.: Heavy-traffic analysis of two coupled processors. Queueing Syst. 43, 173–220 (2003)
Konheim, A.G., Meilijson, I., Melkman, A.: Processor sharing of two parallel lines. J. Appl. Probab. 18, 952–956 (1981)
Kumaran, K., Margrave, G., Mitra, D., Stanley, K.: Novel techniques for the design and control of generalized processor sharing schedulers for multiple QoS classes. In: Proc. IEEE Infocom 2000, Tel-Aviv, Israel (2000)
Massoulié, L.: Large deviations estimates for polling and weighted fair queueing service systems. Adv. Perf. Anal. 2, 103–128 (1999)
Morrison, J.A.: Diffusion approximation for head-of-the-line processor sharing for two parallel queues. SIAM J. Appl. Math. 53, 471–490 (1993)
Parekh, A.K., Gallager, R.G.: A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Trans. Netw. 1, 344–357 (1993)
Parekh, A.K., Gallager, R.G.: A generalized processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Trans. Netw. 2, 137–150 (1994)
Ramanan, K., Reiman, M.I.: Fluid and heavy-traffic diffusion limits for a generalized processor sharing model. Ann. Appl. Probab. 13, 100–139 (2003)
Ramanan, K., Reiman, M.I.: The heavy-traffic limit of an unbalanced generalized processor sharing model. Ann. Appl. Probab. 18, 22–58 (2008)
Yaron, O., Sidi, M.: Generalized Processor Sharing networks with exponentially bounded burstiness arrivals. In: Proc. IEEE Infocom ’94, pp. 628–634 (1994)
Zhang, Z.-L.: Large deviations and the generalized processor sharing scheduling for a multiple-queue system. Queueing Syst. 28, 349–376 (1998)
Author information
Authors and Affiliations
Corresponding author
Additional information
J.A. Morrison is a consultant.
S.C. Borst is also affiliated with Eindhoven University of Technology.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Morrison, J.A., Borst, S.C. Interacting queues in heavy traffic. Queueing Syst 65, 135–156 (2010). https://doi.org/10.1007/s11134-010-9174-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-010-9174-1
Keywords
- Asymptotic expansion
- Bandwidth sharing
- Coupled processors
- First-order approximation
- Heavy traffic
- Generalized processor sharing
- Perturbation
- State-dependent service rates
- Time scale decomposition