A Mixed Discrete-Time Delay/Retrial Queueing Model for Handover Calls and New Calls Competing for a Target Channel

  • Rein NobelEmail author
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 383)


To study the performance of handover calls approaching a target cell in combination with arrivals of new calls competing for the same cell, a mixed discrete-time delay/retrial model with one server and with priorities for the delayed customers is discussed. The handover calls are modeled as high-priority customers and the new calls as low-priority customers. The priority is non-preemptive. Upon arrival high-priority customers are put in a queue which is served on a first come first served basis. The behavior of the low-priority customers is modeled as in a retrial queue. Arrivals are in batches and all customers are served individually according to generally distributed and independent service times. The joint steady-state distribution of the queue length of the high priority customers and the orbit size of the low-priority customers is studied using probability generating functions. Several performance measures will be calculated, such as the mean queue length of the handover calls and the orbit size of the new calls. Also the covariance between the queue length and the orbit size will be studied, among others.


Handover calls Discrete-time retrial queue Priority customers Generating functions 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Artalejo, J.R., Gómez-Corral, A.: Retrial Queueing Systems. Springer-Verlag, Heidelberg (2008)CrossRefGoogle Scholar
  2. 2.
    Choi, B.D., Kim, J.W.: Discrete-time \(Geo_{1}, Geo_{2}/G/1\) retrial queueing systems with two types of calls. Computers and Mathematics with Applications 33, 79–88 (1997)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Falin, G.I., Artalejo, J.R., Martin, M.: On the single server retrial queue with priority customers. Queueing Systems 14, 439–455 (1993)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Falin, G.I., Templeton, J.G.C.: Retrial Queues. Chapman & Hall, London (1997)CrossRefGoogle Scholar
  5. 5.
    Li, H., Yang, T.: \(Geo/G/1\) discrete time retrial queue with Bernoulli schedule. European Journal of Operational Research 111, 629–649 (1998)CrossRefGoogle Scholar
  6. 6.
    Li, H., Yang, T.: Steady-State Queue Size Distribution of Discrete-Time \(PH/Geo/1\) Retrial Queues. Mathematical and Computer Modelling 30, 51–63 (1999)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Nobel, R.D., Moreno, P.: A discrete-time priority loss/retrial queueing model with two types of traffic. In: Choi, B.D. (ed.) Proceedings of the Korea-Netherlands Joint Conference on Queueing Theory and its Applications to Telecommunication Systems, Seoul, pp. 189–207 (2005)Google Scholar
  8. 8.
    Nobel, R.D., Moreno, P.: A discrete-time retrial queueing model with one server. EJOR 189(3), 1088–1103 (2008)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Yang, T., Li, H.: On the steady-state queue size distribution of the discrete-time \(Geo/G/1\) queue with repeated customers. Queueing Systems 25, 199–215 (1995)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of EconometricsVrije UniversityAmsterdamThe Netherlands

Personalised recommendations