Skip to main content
SpringerLink
Log in

Computation of the steady state distribution for multi-server retrial queues with phase type service process

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We consider a multi-server retrial queueing system with the Batch Markovian Arrival Process and phase type service time distribution. Such a general queueing system suits for modeling and decision making in many real life objects including modern wireless communication networks. Behavior of such a system is described by the level dependent multi-dimensional Markov chain. Blocks of the generator of this chain, which is the block structured matrix of infinite size, can have large size if the number of servers is large and distribution of service time is not exponential. Due to this fact, the existing in literature algorithms allow to compute key performance measures of such a system only for a small number of servers. Here we describe the algorithm that allows to compute the stationary distribution of the system for larger number of servers and numerically illustrate its advantage. Importance of taking into account correlation in the arrival process is numerically demonstrated.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Artalejo, J. R. (2010). Accessible bibliography on retrial queues: progress in 2000–2009. Mathematical and Computer Modelling, 51, 1071–1081.

    Article  Google Scholar 

  • Artalejo, J. R., & Comez-Corral, A. (2008). Retrial queueing systems: a computational approach. Berlin: Springer.

    Book  Google Scholar 

  • Breuer, L., Dudin, A. N., & Klimenok, V. I. (2002). A retrial BMAP/PH/N system. Queueing Systems, 40, 433–457.

    Article  Google Scholar 

  • Breuer, L., Klimenok, V. I., Birukov, A. A., Dudin, A. N., & Krieger, U. (2005). Modeling the access to a wireless network at hot spots. European Transactions on Telecommunications, 16, 309–316.

    Article  Google Scholar 

  • Falin, G. I., & Templeton, J. G. C. (1997). Retrial queues. London: Chapman & Hall.

    Google Scholar 

  • Gomez-Corral, A. (2006). A bibliographical guide to the analysis of retrial queues through matrix analytic techniques. Annals of Operations Research, 141, 163–191.

    Article  Google Scholar 

  • Kemeni, J. G., Snell, J. L., & Knapp, A. W. (1966). Denumerable Markov chains. New York: Van Nostrand.

    Google Scholar 

  • Klimenok, V. I., & Dudin, A. N. (2006). Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory. Queueing Systems, 54, 245–259.

    Article  Google Scholar 

  • Klimenok, V. I., Orlovsky, D. S., & Dudin, A. N. (2007). A BMAP/PH/N system with impatient repeated calls. Asia-Pacific Journal of Operational Research, 24, 293–312.

    Article  Google Scholar 

  • Lucantoni, D. M. (1991). New results on the single server queue with a batch Markovian arrival process. Communications in Statistics. Stochastic Models, 7, 1–46.

    Article  Google Scholar 

  • Naoumov, V., Krieger, U. R., & Wagner, D. (1996). Analysis of a multiserver delay-loss system with a general Markovian arrival process. Lecture Notes in Pure and Applied Mathematics, 183, 43–66.

    Google Scholar 

  • Neuts, M. F. (1981). Matrix-geometric solutions in stochastic models. Baltimore: Johns Hopkins University Press.

    Google Scholar 

  • Neuts, M. F. (1989). Structured stochastic matrices of M/G/1 type and their applications. New York: Dekker.

    Google Scholar 

  • Pattavina, A., & Parini, A. (2005). Modelling voice call inter-arrival and holding time distributions in mobile networks. In: The 19th international teletraffic congress. Performance challenges for efficient next generation networks, Aug.–Sept., 2005 (pp. 729–738).

    Google Scholar 

  • Ramaswami, V. (1985). Independent Markov process in parallel. Communications in Statistics. Stochastic Models, 1, 419–432.

    Article  Google Scholar 

  • Ramaswami, V., & Lucantoni, D. (1985). Algorithm for the multi-server queue with phase-type service. Communications in Statistics. Stochastic Models, 1, 393–417.

    Article  Google Scholar 

Download references

Acknowledgements

This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (Grant No. 2010-0003269). This paper was also supported by research funds of Sangji University in 2011.

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Sangji University, Wonju, 220-702, Republic of Korea

    Che Soong Kim

  2. Department of Applied Mathematics and Computer Science, Belarusian State University, 4, Nezavisimosti Ave., Minsk, 220030, Belarus

    Vilena V. Mushko & Alexander N. Dudin

Authors
  1. Che Soong Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vilena V. Mushko
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexander N. Dudin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander N. Dudin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kim, C.S., Mushko, V.V. & Dudin, A.N. Computation of the steady state distribution for multi-server retrial queues with phase type service process. Ann Oper Res 201, 307–323 (2012). https://doi.org/10.1007/s10479-012-1254-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-012-1254-7

Keywords

Search

Navigation