Advertisement

Analysis of MAP/PH/c Retrial Queue with Phase Type Retrials – Simulation Approach

  • Srinivas R. Chakravarthy
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 356)

Abstract

In this paper we study a multi-server retrial queueing model in which customers arrive according to a Markovian arrival process (MAP) and the service times are assumed to be of phase type (PH-type). An arriving customer finding all servers busy will enter into a (retrial) orbit of infinite size. The customers in orbit will try to capture a free server after a random amount of time which is assumed to be of PH-type. Thus, every customer in the orbit has his/her own phase type distribution before attempting to get into service. Due to the complexity of the model and lack of attention to such models in the literature, we study this via simulation. After validating our simulated results against known results (both exact and approximation) for some special cases, we illustrate how one can underestimate or overestimate some key system performance measures by incorrectly assuming the retrial times to be exponential.

Keywords

Service Time Phase Type Retrial Queue Retrial Model System Performance Measure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Artalejo, J.R., Gomez-Corral, A.: Modelling communication systems with phase type service and retrial times. IEEE Communications Letters 11, 955–957 (2007)CrossRefGoogle Scholar
  2. 2.
    Artalejo, J.R., Gomez-Corral, A.: Retrial Queueing Systems, A Computational Approach. Springer, Heidelberg (2008)zbMATHCrossRefGoogle Scholar
  3. 3.
    Artalejo, J.R., Gomez-Correl, A., He, Q.M.: Markovian arrivals in stochastic modelling: a survey and some new results. SORT 34(2), 101–144 (2010)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Chakravarthy, S.R.: The batch Markovian arrival process: A review and future work. In: Krishnamoorthy, A., et al. (eds.) Advances in Probability Theory and Stochastic Processes, pp. 21–39. Notable Publications Inc., NJ (2001)Google Scholar
  5. 5.
    Chakravarthy, S.R.: Markovian Arrival Processes. Wiley Encyclopedia of Operations Research and Management Science (June 15, 2010)Google Scholar
  6. 6.
    Diamond, J.E., Alfa, A.S.: Approximation method for M/PH/1 retrial queues with phase type inter-retrial times. European Journal of Operational Research 113, 620–631 (1999)zbMATHCrossRefGoogle Scholar
  7. 7.
    Falin, G.I., Templeton, J.G.C.: Retrial Queues. Chapman and Hall, London (1997)zbMATHGoogle Scholar
  8. 8.
    He, Q.M., Li, H., Zhao, Y.Q.: Ergodicity of the BMAP/PH/s/s + K retrial queue with PH-retrial times. Queueing Systems 35, 323–347 (2000)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Kelton, W.D., Sadowski, R.P., Swets, N.B.: Simulation with ARENA, 5th edn. McGraw-Hill, New York (2010)Google Scholar
  10. 10.
    Lucantoni, D.M.: New results on the single server queue with a batch Markovian arrival process. Stochastic Models 7, 1–46 (1991)MathSciNetzbMATHGoogle Scholar
  11. 11.
    Marcus, M., Minc, H.: A Survey of Matrix Theory and Matrix Inequalities. Allyn and Bacon, Boston (1964)zbMATHGoogle Scholar
  12. 12.
    Neuts, M.F.: A versatile Markovian point process. J. Appl. Prob. 16, 764–779 (1979)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. The Johns Hopkins University Press, Baltimore (1994 version is Dover Edition)Google Scholar
  14. 14.
    Neuts, M.F.: Structured Stochastic Matrices of M/G/1 type and their Applications. Marcel Dekker, NY (1989)Google Scholar
  15. 15.
    Neuts, M.F.: Models based on the Markovian arrival process. IEICE Transactions on Communications E75B, 1255–1265 (1992)Google Scholar
  16. 16.
    Neuts, M.F.: Algorithmic Probability: A collection of problems. Chapman and Hall, NY (1995)zbMATHGoogle Scholar
  17. 17.
    Senthilkumar, M., Sohraby, K., Kim, K.: On a multiserver retrial queue with phase type retrial time. In: Nadarajan, R., et al. (eds.) Mathematical and Computational Models, pp. 65–78. Narosa Publishing House, New Delhi (2012)Google Scholar
  18. 18.
    Shin, Y.W.: Algorithmic solutions for M/M/c retrial queue with PH2 retrial time. Journal of Applied Mathematics and Informatics 29, 803–811 (2011)MathSciNetzbMATHGoogle Scholar
  19. 19.
    Shin, Y.W., Moon, D.H.: Approximation of M/M/c retrial queue with PH-retrial times. European Journal of Operational Research 213, 205–209 (2011)MathSciNetzbMATHCrossRefGoogle Scholar
  20. 20.
    Yang, T., Posner, M.J.M., Templeton, J.G.C., Li, H.: An approximation method for the M/G/1 retrial queues with general retrial times. European Journal of Operational Research 76, 552–562 (1994)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Srinivas R. Chakravarthy
    • 1
  1. 1.Department of Industrial and Manufacturing EngineeringKettering UniversityFlintUSA

Personalised recommendations