Abstract
In this paper, a single server retrial queue MMPP/M/1 with impatient calls is analysed under the heavy load condition. The retrial queue has a dynamical rate of the calls patience depending on the number of calls in the orbit. It is proved that under the heavy load condition the asymptotic characteristic function of the number of calls in the orbit has the gamma distribution with obtained parameters. Also the formula for the system throughput is obtained. Some numerical examples are presented.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Wilkinson, R.I.: Theories for toll traffic engineering in the USA. Bell Syst. Tech. J. 35(2), 421–507 (1956). https://doi.org/10.1002/j.1538-7305.1956.tb02388.x
Cohen, J.W.: Basic problems of telephone traffic and the influence of repeated calls. Philips Telecommun. Rev. 18(2), 49–100 (1957)
Elldin, A., Lind, G.: Elementary Telephone Traffic Theory. Ericsson Public Telecommunications, Stockholm (1971)
Gosztony, G.: Repeated call attempts and their effect on traffic engineering. Budavox Telecommun. Rev. 2, 16–26 (1976)
Roszik, J., Sztrik, J., Kim, C.: Retrial queues in the performance modelling of cellular mobile networks using MOSEL. Int. J. Simul. 6, 38–47 (2005)
Nazarov, A.A., Kuznetsov, D.Y.: Analysis of Non-Markovian models of communication networks with adaptive protocols of multiple random access. Autom. Remote Control 5, 789–808 (2001)
Choi, B.D., Chang, Y.: Single server retrial queues with priority calls. Mathe. Comput. Modeling 30, 7–32 (1999)
Tran-Gia, P., Mandjes, M.: Modeling of customer retrial phenomenon in cellular mobile networks. IEEE J. Sel. Areas Commun. 15, 1406–1414 (1997). https://doi.org/10.1109/49.634781
Phung-Duc, T., Kawanishi, K.: An efficient method for performance analysis of blended call centers with redial. Asia-Pac. J. Oper. Res. 31(2), 1–39 (2014). https://doi.org/10.1142/S0217595914400089
Aguir, S., Karaesmen, F., Askin, O.Z., Chauvet, F.: The impact of retrials on call center performance. OR Spektrum. 26, 353–376 (2004)
Kim, J.: Retrial queueing system with collision and impatience. Commun. Korean Math. Soc. 4, 647–653 (2010)
Artalejo, J.R., Gómez-Corral, A.: Retrial Queueing Systems. A Computational Approach. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78725-9
Artalejo, J.R., Falin, G.I.: Standard and retrial queueing systems: a comparative analysis. Revista Matematica Complutense 15, 101–129 (2002)
Falin, G.I., Templeton, J.G.C.: Retrial Queues. Chapman & Hall, London (1997)
Yang, T., Posner, M., Templeton, J.: The M/G/1 retrial queue with non-persistent customers. Queueing Syst. 7(2), 209–218 (1990)
Krishnamoorthy, A., Deepak, T.G., Joshua, V.C.: An M/G/1 retrial queue with non-persistent customers and orbital search. Stoch. Anal. Appl. 23, 975–997 (2005). https://doi.org/10.1080/07362990500186753
Fayolle, G., Brun, M.A.: On a system with impatience and repeated calls. In: Queueing Theory and Its Applications: Liber Amicorum for J.W. Cohen, North Holland, Amsterdam, pp. 283–305 (1998)
Martin, M., Artalejo, J.R.: Analysis of an M/G/1 queue with two types of impatient units. Adv. Appl. Probab. 27, 840–861 (1995). https://doi.org/10.2307/1428136
Aissani, A., Taleb, S., Hamadouche, D.: An unreliable retrial queue with impatience and preventive maintenance. In: Proceedings, 15th Applied Stochastic Models and Data Analysis (ASMDA2013), Mataró (Barcelona), Spain, pp. 1–9 (2013)
Kumar, M.S., Arumuganathan, R.O.: Performance analysis of single server retrial queue with general retrial time, impatient subscribers, two phases of service and bernoulli schedule. Tamkang J. Sci. Eng. 13(2), 135–143 (2010)
Arrar, N.K., Djellab, N.V., Baillon, J.-B.: On the asymptotic behaviour of M/G/1 retrial queues with batch arrivals and impatience phenomenon. Math. Comput. Modell. 55, 654–665 (2012). https://doi.org/10.1016/j.mcm.2011.08.039
Artalejo, J.R., Pozo, M.: Numerical calculation of the stationary distribution of the main multiserver retrial queue. Ann. Oper. Res. 116, 41–56 (2002). https://doi.org/10.1023/A:1021359709489
Neuts, M.F., Rao, B.M.: Numerical investigation of a multiserver retrial model. Queueing Syst. 7(2), 169–189 (1990). https://doi.org/10.1007/BF01158473
Shin, Y.W., Choo, T.S.: M/M/s queue with impatient customers and retrials. Appl. Math. Model. 33, 2596–2606 (2009)
Dudin, A.N., Klimenok, V.I.: Queueing system \(BMAP/G/1\) with repeated calls. Math. Comput. Modell. 30(3–4), 115–128 (1999). https://doi.org/10.1016/S0895-7177(99)00136-3
Gómez-Corral, A.G.: A bibliographical guide to the analysis of retrial queues through matrix analytic techniques. Ann. Oper. Res. 141, 163–191 (2006). https://doi.org/10.1007/s10479-006-5298-4
Diamond, J.E., Alfa, A.S.: Matrix analytical methods for M/PH/1 retrial queues. Stoch. Models 11, 447–470 (1995). https://doi.org/10.1080/15326349508807355
Lopez-Herrero, M.J.: Distribution of the number of customers served in an M/G/1 retrial queue. J. Appl. Probab. 39(2), 407–412 (2002). https://doi.org/10.1239/jap/1025131437
Nazarov, A., Moiseev, A.: Queueing network \(MAP-(GI/\infty )^K\) with high-rate arrivals. Eur. J. Oper. Res. 254, 161–168 (2016). https://doi.org/10.1016/j.ejor.2016.04.011
Pankratova, E., Moiseeva, S.: Queueing system MAP/M/\(\infty \) with n types of customers. Commun. Comput. Inf. Sci. 487, 356–366 (2014). https://doi.org/10.1007/978-3-319-13671-4_41
Moiseeva, E., Nazarov, A.: Asymptotic analysis of RQ-systems M/M/1 on heavy load condition. In: Proceedings of the IV International Conference Problems of Cybernetics and Informatics, Baku, Azerbaijan, pp. 64–166 (2012)
Dudin, A., Nazarov, A., Kirpichnikov, A. (eds.): ITMM 2017. CCIS, vol. 800. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68069-9
Danilyuk, E.Y., Fedorova, E.A., Moiseeva, S.P.: Asymptotic analysis of an retrial queueing system M/M/1 with collisions and impatient calls. Autom. Remote Control 79(12), 2136–2146 (2018). https://doi.org/10.1134/S0005117918120044
Vygovskaya, O., Danilyuk, E., Moiseeva, S.: Retrial queueing system of MMPP/M/2 type with impatient calls in the orbit. In: Dudin, A., Nazarov, A., Moiseev, A. (eds.) ITMM/WRQ-2018. CCIS, vol. 912, pp. 387–399. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-97595-5_30
Danilyuk, E., Vygoskaya, O., Moiseeva, S.: Retrial queue M/M/N with impatient customer in the orbit. In: Vishnevskiy, V.M., Kozyrev, D.V. (eds.) DCCN 2018. CCIS, vol. 919, pp. 493–504. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-99447-5_42
Falin, G.I.: M/G/1 queue with repeated calls in heavy traffic. Moscow Univ. Math. Bull. 6, 48–50 (1980)
Anisimov, V.V.: Asymptotic analysis of reliability for switching systems in light and heavy traffic conditions. In: Limnios, N., Nikulin, M. (eds.) Recent Advances in Reliability Theory, vol. 8, pp. 119–133. Birkhäuser, Boston (1980). https://doi.org/10.1007/978-1-4612-1384-0_8
Stepanov, S.N.: Asymptotic analysis of models with repeated calls in case of extreme load. Probl. Inf. Transm. 29(3), 248–267 (1993)
Neuts, M.F.: A Versatile Markovian point process. J. Appl. Probab. 16(4), 764–779 (1979). https://doi.org/10.2307/3213143
Lucantoni, D.M.: New results on the single server queue with a batch Markovian arrival process. Stoch. Models 7, 1–46 (1991). https://doi.org/10.1080/15326349108807174
Moiseev, A., Demin, A., Dorofeev, V., Sorokin, V.: Discrete-event approach to simulation of queueing networks. Key Eng. Mater. 685, 939–942 (2016). https://doi.org/10.4028/www.scientific.net/KEM.685.939
Acknowledgments
The reported study was funded by RFBR according to the research project No. 19-41-703002.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Fedorova, E., Danilyuk, E., Nazarov, A., Melikov, A. (2019). Retrial Queueing System MMPP/M/1 with Impatient Calls Under Heavy Load Condition. In: Phung-Duc, T., Kasahara, S., Wittevrongel, S. (eds) Queueing Theory and Network Applications. QTNA 2019. Lecture Notes in Computer Science(), vol 11688. Springer, Cham. https://doi.org/10.1007/978-3-030-27181-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-27181-7_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-27180-0
Online ISBN: 978-3-030-27181-7
eBook Packages: Computer ScienceComputer Science (R0)