Hostname: page-component-cb9f654ff-r5d9c Total loading time: 0 Render date: 2025-08-18T10:08:02.043Z Has data issue: false hasContentIssue false
  • English
  • Français

Extended generator and associated martingales for M/G/1 retrial queue with classical retrial policy and general retrial times

Published online by Cambridge University Press:  11 January 2022

S. Meziani  and
T. Kernane Open the ORCID record for T. Kernane [Opens in a new window]
S. Meziani
Affiliation:
Department of Probability and Statistics, Faculty of Mathematics, University of Sciences and Technology USTHB, Algiers, Algeria. E-mail: smeziani@usthb.dz
T. Kernane
Affiliation:
Department of Probability and Statistics, Faculty of Mathematics, University of Sciences and Technology USTHB, Algiers, Algeria. E-mail: smeziani@usthb.dz Laboratory of Research in Intelligent Informatics and Applied Mathematics (RIIMA), University of Sciences and Technology USTHB, Algiers, Algeria. E-mail: tkernane@gmail.com
Get access Rights & Permissions [Opens in a new window]

Abstract

A retrial queue with classical retrial policy, where each blocked customer in the orbit retries for service, and general retrial times is modeled by a piecewise deterministic Markov process (PDMP). From the extended generator of the PDMP of the retrial queue, we derive the associated martingales. These results are used to derive the conditional expected number of customers in the orbit in the transient regime.

Keywords

Extended generatorMartingalePiecewise deterministic Markov processRetrial queue

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 37 , Issue 1 , January 2023 , pp. 206 - 213
Copyright
Copyright © The Author(s), 2022. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Breuer, L. (2008). Continuity of the M/G/c queue. Queueing Systems 58(4): 321–331.CrossRefGoogle Scholar
Chakravarthy, S.R. (2013). Analysis of MAP/PH/c retrial queue with phase type retrials–simulation approach. In Belarusian Workshop on Queueing Theory. Springer, pp. 37–49.CrossRefGoogle Scholar
Clancy, D. (2014). SIR epidemic models with general infectious period distribution. Statistics & Probability Letters 85: 1–5.CrossRefGoogle Scholar
Costa, O.L.V. (1990). Stationary distributions for piecewise-deterministic Markov processes. Journal of Applied Probability 27(1): 60–73.CrossRefGoogle Scholar
Costa, O.L.V. & Dufour, F. (2008). Stability and ergodicity of piecewise deterministic Markov processes. SIAM Journal on Control and Optimization 47(2): 1053–1077.CrossRefGoogle Scholar
Dassios, A. & Zhao, H. (2011). A dynamic contagion process. Advances in Applied Probability 43(3): 814–846.CrossRefGoogle Scholar
Davis, M.H. (1984). Piecewise-deterministic Markov processes: A general class of non-diffusion stochastic models. Journal of the Royal Statistical Society: Series B (Methodological) 46(3): 353–376.Google Scholar
Davis, M.H. (1993). Markov models & optimization. London, UK: Chapman & Hall.CrossRefGoogle Scholar
Dufour, F. & Costa, O.L. (1999). Stability of piecewise-deterministic Markov processes. SIAM Journal on Control and Optimization 37(5): 1483–1502.CrossRefGoogle Scholar
Falin, G.I. (1986). Single-line repeated orders queueing systems. Optimization 17(5): 649–667.CrossRefGoogle Scholar
Falin, G.I. (1990). A survey of retrial queues. Queueing Systems 7: 127–168.CrossRefGoogle Scholar
Falin, G.I. & Templeton, J.G.C. (1997). Retrial queues. London, UK: Chapman & Hall.CrossRefGoogle Scholar
Farahmand, K. (1990). Single line queue with repeated demands. Queueing Systems 6(1): 223–228.CrossRefGoogle Scholar
Fayolle, G. (1986). A simple telephone exchange with delayed feedback. In O.J. Boxma, J.W. Cohen, & H.C. Tijms (eds.), Teletraffic analysis, computer performance evaluation, vol. 46. Amsterdam: Elsevier Science, pp. 561–581.Google Scholar
Gómez-Corral, A. & López-García, M. (2017). On SIR epidemic models with generally distributed infectious periods: Number of secondary cases and probability of infection. International Journal of Biomathematics 10(2): 1750024.CrossRefGoogle Scholar
Kapyrin, V. (1977). Stationary characteristics of a queuing system with repeated calls. Cybernetics 13(4): 584–590.CrossRefGoogle Scholar
Kernane, T. (2008). Conditions for stability and instability of retrial queueing systems with general retrial times. Statistics & Probability Letters 78(18): 3244–3248.CrossRefGoogle Scholar
Kim, C., Klimenok, V., & Dudin, A. (2014). A G/M/1 retrial queue with constant retrial rate. Top 22(2): 509–529.CrossRefGoogle Scholar
Lillo, R. (1996). A G/M/1-queue with exponential retrial. Top 4(1): 99–120.CrossRefGoogle Scholar
Shin, Y.W. & Moon, D.H. (2011). Approximation of M/M/c retrial queue with ph-retrial times. European Journal of Operational Research 213(1): 205–209.CrossRefGoogle Scholar
Shin, Y.W. & Moon, D.H. (2014). Approximation of PH/PH/c retrial queue with ph-retrial time. Asia-Pacific Journal of Operational Research 31(2): 1440010.CrossRefGoogle Scholar