Queueing Systems

, Volume 14, Issue 3, pp 439–455

On the single server retrial queue with priority customers

Authors

  • G. I. Falin
    • Department of Statistics and Operations Research, Mathematics FacultyMadrid University-Complutense
  • J. R. Artalejo
    • Department of Statistics and Operations Research, Mathematics FacultyMadrid University-Complutense
  • M. Martin
    • Department of Statistics and Operations Research, Mathematics FacultyMadrid University-Complutense
Articles

DOI: 10.1007/BF01158878

Cite this article as:
Falin, G.I., Artalejo, J.R. & Martin, M. Queueing Syst (1993) 14: 439. doi:10.1007/BF01158878

Abstract

We consider anM2/G2/1 type queueing system which serves two types of calls. In the case of blocking the first type customers can be queued whereas the second type customers must leave the service area but return after some random period of time to try their luck again. This model is a natural generalization of the classicM2/G2/1 priority queue with the head-of-theline priority discipline and the classicM/G/1 retrial queue. We carry out an extensive analysis of the system, including existence of the stationary regime, embedded Markov chain, stochastic decomposition, limit theorems under high and low rates of retrials and heavy traffic analysis.

Keywords

Priority queueshead-of-the-line priority disciplineretrialslimit theoremsstochastic decomposition

Copyright information

© J.C. Baltzer AG, Science Publishers 1993