Queueing Systems

, Volume 19, Issue 1, pp 215–229

M/G/1 retrial queueing systems with two types of calls and finite capacity

  • Bong Dae Choi
  • Ki Bong Choi
  • Yong Wan Lee
Article

DOI: 10.1007/BF01148947

Cite this article as:
Choi, B.D., Choi, K.B. & Lee, Y.W. Queueing Syst (1995) 19: 215. doi:10.1007/BF01148947

Abstract

We consider anM/G/1 priority retrial queueing system with two types of calls which models a telephone switching system and a cellular mobile communication system. In the case that arriving calls are blocked due to the server being busy, type I calls are queued in a priority queue of finite capacityK whereas type II calls enter the retrial group in order to try service again after a random amount of time. In this paper we find the joint generating function of the numbers of calls in the priority queue and the retrial group in closed form. When λ1=0, it is shown that our results are consistent with the known results for a classical retrial queueing system.

Keywords

Retrial queuefinite capacitynon-preemptive priority

Copyright information

© J.C. Baltzer AG, Science Publishers 1995

Authors and Affiliations

  • Bong Dae Choi
    • 1
  • Ki Bong Choi
    • 1
  • Yong Wan Lee
    • 1
  1. 1.Department of MathematicsKorea Advanced Institute of Science and TechnologyTaejonKorea