Skip to main content
Log in

Queueing systems with different service disciplines

  • Published:
Lobachevskii Journal of Mathematics Aims and scope Submit manuscript

Abstract

In this paper we investigate multiserver queueing systems with regenerative input flow and independent service times with finite mean. Various service disciplines are considered: systems with common queue and systems with parallel queues when an arrived customer chooses server in accordance with a certain rule and stays in chosen queue until the moment of service start. We define some classes of disciplines and establish the necessary and sufficient condition of stability.

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. J. Grandell, Double Stochastic Poisson Processes, Lecture Notes in Mathematics (Springer, Berlin, Heidelberg, New York, 1976).

    Book  MATH  Google Scholar 

  2. S. Asmussen, “Ladder heights and the Markov-modulated M|G|1 queue,” Stochast. Process Appl. 37, 313–326 (1991).

    Article  MathSciNet  MATH  Google Scholar 

  3. L. Afanasyeva, E. Bashtova, and E. Bulinskaya, “Limit theorems for semi-Markov queues and their applications,” Commun. Stat., Pt. B: Simul. Comput. 41, 688–709 (2012).

    Article  MathSciNet  MATH  Google Scholar 

  4. S. L. Brunnel, “Some inequalities for parallel-server queues,” Opns. Res. 19, 402–413 (1971).

    Article  MathSciNet  Google Scholar 

  5. J. F. C. Kingman, “Inequalities in the theory of queues,” J. R. Stat. Soc., Ser. B 32, 102–110 (1970).

    MathSciNet  MATH  Google Scholar 

  6. R. W. Wolff, “An upper bound for multi-channel queues,” J. Appl. Prob. 14, 884–888 (1977).

    Article  MathSciNet  MATH  Google Scholar 

  7. R. D. Foley and D. R. McDonald, “Join the shortest queue: stability and exact asymptotics,” Ann. Appl. Probab. 11, 569–607 (2001).

    MathSciNet  MATH  Google Scholar 

  8. P. Eschenfeldt and D. Gamarnik, “Join the shortest queue with many servers. The heavy traffic asymptotics,” arXiv:1502.00999.

  9. J. Kiefer and J. Wolfowitz, “On the theory of queues with many servers,” Trans. Am. Math. Soc. 78, 1–18 (1955).

    Article  MathSciNet  MATH  Google Scholar 

  10. L. G. Afanaseva and A. V. Tkachenko, “Multi-channel queueing systems with regenerative input flow,” Teor. Veroyatn. Primen. 58, 210–234 (2013).

    Article  Google Scholar 

  11. L. G. Afanaseva and E. E. Bashtova, “Coupling method for asymptotic analysis of queues with regenerative input and unreliable server,” Queueing Syst. 76, 125–147 (2014).

    Article  MathSciNet  MATH  Google Scholar 

  12. A. V. Tkachenko, “Multi-channel queueing systems with non-identical servers,” Dissertation (Moscow, 2013).

    Google Scholar 

  13. R. M. Loynes, “The stability of a queue with non-independent inter-arrival and service times,” Proc. Cambridge Phil. Soc. 58, 494–520 (1962).

    Article  MathSciNet  MATH  Google Scholar 

  14. W. Whitt, Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and their Application to Queues (Springer, Berlin, 2002).

    MATH  Google Scholar 

  15. L. G. Afanaseva, “Ergodicity of multi-channel queueing systems,” in Proceedings of the Workshop on Problems of Stability of Stochastic Models, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to L. G. Afanasyeva.

Additional information

Submitted by A. M. Elizarov

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Afanasyeva, L.G., Grishunina, S.A. Queueing systems with different service disciplines. Lobachevskii J Math 38, 864–869 (2017). https://doi.org/10.1134/S199508021705002X

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S199508021705002X

Keywords and phrases

Navigation