skip to main content
10.1145/1626553.1626567acmconferencesArticle/Chapter ViewAbstractPublication PagesqtnaConference Proceedingsconference-collections
research-article

Tail behavior of the queue size distribution in the M/M/m retrial queue

Authors Info & Claims
Published:29 July 2009Publication History

ABSTRACT

We consider an M/M/m retrial queue and investigate the tail asymptotics for the joint distribution of the number of customers in the orbit and the number of busy servers in the steady state. In addition, we illustrate the tail asymptotic behavior through numerical examples.

References

  1. J. R. Artalejo, A classified bibliography of research on retrial queues: Progress in 1990--1999, Top 7 (1999), 187--211.Google ScholarGoogle ScholarCross RefCross Ref
  2. J. R. Artalejo, Accessible bibliography on retrial queues, Math. Comput. Model. 30 (1999), 1--6. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. R. Artalejo and A. Gomez-Corral, Retrial Queueing Systems, Springer, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  4. N. Deul, Stationary conditions for multi-server queueing systems with repeated calls, Elektr. Informationsverarbeit. Kybernet. 16 (1980), 607--613.Google ScholarGoogle Scholar
  5. G. I. Falin, On sufficient conditions for ergodicity of multichannel queueing systems with repeated calls, Adv. Appl. Prob. 16 (1984), 447--448.Google ScholarGoogle ScholarCross RefCross Ref
  6. G. I. Falin, A survey of retrial queues, Queueing Systems 7 (1990), 127--168. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. G. I. Falin and J. G. C. Templeton, Retrial Queues, Chapman&Hall, London, 1997.Google ScholarGoogle Scholar
  8. B. S. Greenberg and R. W. Wolff, An upper bound on the performance of queues with returning customers, J. Appl. Prob. 24 (1987), 466--475.Google ScholarGoogle ScholarCross RefCross Ref
  9. T. Hanschke, Explicit formulas for the characteristics of the M/M/2/2 queue with repeated attempts, J. Appl. Prob. 24 (1987), 486--494.Google ScholarGoogle ScholarCross RefCross Ref
  10. A. Jeffrey and V. G. Oklobdzija, Linear Algebra and Ordinary Differential Equations, CRC Press, 1993.Google ScholarGoogle Scholar
  11. J. Keilson, J. Cozzolino and H. Young, A service system with unfilled requests repeated, Oper. Res. 16 (1968), 1126--1137.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. J. Kim, B. Kim and S-S Ko, Tail asymptotics for the queue size distribution in an M/G/1 retrial queue, J. Appl. Prob. 44 (2007), 1111--1118.Google ScholarGoogle ScholarCross RefCross Ref
  13. J. Kim, J. Kim and B. Kim, Tail behavior of the queue size distribution in the M/M/m retrial queue and its application, preprint.Google ScholarGoogle Scholar
  14. M. F. Neuts and B. M. Rao, Numerical investigation of a multiserver retrial model, Queueing Systems 7 (1990), 169--190. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. C. E. M. Pearce, On the problem of re-attempted calls in teletraffic, Commun. Statist.-Stochastic Models 3 (1987), 393--407.Google ScholarGoogle ScholarCross RefCross Ref
  16. R. I. Wilkinson, Theories for toll traffic engineering in the U.S.A., The Bell System Technical Journal 35 (1956), 421--514.Google ScholarGoogle ScholarCross RefCross Ref
  17. T. Yang and J. G. C. Templeton, A survey on retrial queues, Queueing Systems 2 (1982), 201--233. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    QTNA '09: Proceedings of the 4th International Conference on Queueing Theory and Network Applications
    July 2009
    143 pages
    ISBN:9781605585628
    DOI:10.1145/1626553

    Copyright © 2009 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 29 July 2009

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article
  • Article Metrics

    • Downloads (Last 12 months)2
    • Downloads (Last 6 weeks)1

    Other Metrics

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader