Algorithmic Analysis of the Maximum Queue Length in a Busy Period for the M/M/c Retrial Queue
Published Online:1 Feb 2007https://doi.org/10.1287/ijoc.1050.0156
References
- Accessible bibliography on retrial queues. Math. Comput. Model. (1999a) 30:1–6Crossref, Google Scholar
- A classified bibliography of research on retrial queues: Progress in 1990–1999. Top (1999b) 7:187–211Crossref, Google Scholar
- Standard and retrial queueing systems: A comparative analysis. Revista Matemática Complutense (2002) 15:101–129Google Scholar
- New results in the theory of repeated orders queueing systems. J. Appl. Probab. (1979) 16:631–640Crossref, Google Scholar
- Markov Chains with Stationary Transition Probabilities (1967) 2nd ed.(Springer-Verlag, New York) Google Scholar
- Introduction to Numerical Linear Algebra and Optimization (1989) (Cambridge University Press, Cambridge, UK) Crossref, Google Scholar
- Introduction to Queueing Theory (1981) 2nd ed.(Edward Arnold, London, UK) Google Scholar
- Retrial Queues (1997) (Chapman and Hall, London, UK) Crossref, Google Scholar
- On extreme values of orbit lengths in M/G/1 queues with constant retrial rate. OR Spectrum (2001) 23:395–409Crossref, Google Scholar
- Distribution of the number of customers served in an M/G/1 retrial queue. J. Appl. Probab. (2002) 39:407–412Crossref, Google Scholar
- , Artalejo J. R., Krishnamoorthy A. The distribution of the maximum orbit size of an M/G/1 retrial queue during the busy period. Advances in Stochastic Modelling (2002) (Notable Publications Inc., Chennai, India) 219–231Google Scholar
- Extreme values of birth and death processes and queues. Stochastic Process. Appl. (1988) 27:291–306Crossref, Google Scholar

