Skip to main content
Log in

Processor sharing for two queues with vastly different rates

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We consider a 2-class queueing system, operating under a generalized processor-sharing discipline, in an asymptotic regime where the arrival and service rates of the two classes are vastly different. We use regular and singular perturbation analyses in a small parameter measuring this difference in rates. It is assumed that the system is stable, and not close to instability. Three different regimes are analyzed, corresponding to an underloaded, an overloaded and a critically loaded fast queue, respectively. In the first two regimes the lowest order approximation to the joint stationary distribution of the queue lengths is derived. For a critically loaded fast queue only the mean queue lengths are investigated, and the asymptotic matching, to lowest order, with the results for an underloaded and an overloaded fast queue is established.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions. National Bureau of Standards, Washington (1964)

    Google Scholar 

  2. Altman, E., Avrachenkov, K.E., Núñez-Queija, R.: Perturbation analysis for denumerable Markov chains with application to queueing models. Adv. Appl. Probab. 36, 839–853 (2004)

    Article  Google Scholar 

  3. Borst, S.C., Morrison, J.A.: Bandwidth sharing with disparate flow classes and state-dependent service rates. Preprint

  4. Byrd, P.F., Friedman, M.D.: Handbook of Elliptic Integrals for Engineers and Scientists, 2nd edn. Springer, New York (1971)

    Google Scholar 

  5. Erdélyi, A., Magnus, W., Oberhettinger, F., Tricomi, F.: Tables of Integral Transforms, vol. 1. McGraw-Hill, New York (1954)

    Google Scholar 

  6. Fayolle, G., Iasnogorodski, R.: Two coupled processors: the reduction to a Riemann–Hilbert problem. Z. Wahrsch. 47, 325–351 (1979)

    Article  Google Scholar 

  7. Gradshteyn, I.S., Ryzhik, I.M.: Tables of Integrals, Series and Products, 4th edn. Academic, New York (1965)

    Google Scholar 

  8. 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)

    Article  Google Scholar 

  9. van Kessel, G., Núñez-Queija, R., Borst, S.C.: Differentiated bandwidth sharing with disparate flow sizes. In: Proc. of INFOCOM, 2005

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to John A. Morrison.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Morrison, J.A. Processor sharing for two queues with vastly different rates. Queueing Syst 57, 19–28 (2007). https://doi.org/10.1007/s11134-007-9043-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-007-9043-8

Keywords

Mathematics Subject Classification (2000)

Navigation