Transient analysis of the successful and blocked events in retrial queues
The phenomenon of repeated attempts arises naturally in telecommunication and computer networks. One aspect of the retrial feature is considered in this paper, where we investigate the transient behavior of the successful and blocked events made by the primary customers and the retrial customers.
KeywordsRetrial queues Transient analysis Successful and blocked events
Unable to display preview. Download preview PDF.
- 1.Abate, J., & Whitt, W. (1995). Numerical inversion of Laplace transforms of probability distributions. ORSA Journal on Computing, 7, 36–43. Google Scholar
- 5.Anisimov, V. V. (2008). Switching processes in queueing models. New York: Wiley. Google Scholar
- 8.Artalejo, J. R., & Gomez-Corral, A. (2008). Retrial queueing systems: a computational approach. Berlin: Springer. Google Scholar
- 9.Ciarlet, P. G. (1989). Introduction to numerical linear algebra and optimization. Cambridge: Cambridge University Press. Google Scholar
- 10.Cohen, A. M. (2007). Numerical methods for Laplace transform inversion. New York: Springer. Google Scholar
- 11.Economou, A., & Lopez-Herrero, M. J. (2008). Performance analysis of a cellular mobile network with retrials and guard channels using waiting and first passage time measures. European Transactions on Telecommunications. doi: 10.1002/ett.1294.
- 12.Falin, G. I., & Templeton, J. G. C. (1997). Retrial queues. London: Chapman and Hall. Google Scholar
- 15.Latouche, G., & Ramaswami, V. (1999). Introduction to matrix-analytic methods in stochastic modeling. ASA-SIAM series on statistics and applied probability. Philadelphia: SIAM. Google Scholar
- 18.Medhi, J. (2003). Stochastic models in queueing theory. San Diego: Academic Press. Google Scholar
- 19.Shin, Y. W. (2000). Transient distributions of level dependent quasi-birth-death processes with linear transition rates. Korean Journal of Computational and Applied Mathematics, 7, 83–100. Google Scholar