ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE

Abstract We consider two identical parallel M/M/∞ queues. A new arrival is routed to the queue with the smaller number of customers. If both systems have equal occupancy, the arrival joins either with probability 1/2. These types of models have been used to describe CDMA (Code Division Multiple Access) cellular systems. We analyze this model both numerically and asymptotically. For the latter, we consider the limit ρ = λ/μ → ∞, where λ (resp., μ) is the arrival (resp., service) rate. An efficient numerical method is developed for computing the joint steady-state distribution of the number of customers in the two queues. We give several asymptotic formulas, valid for different ranges of the state variables, which show the qualitative structure of the joint distribution. The numerical accuracy of the asymptotic results is tested.

[1]  J Jaap Wessels,et al.  Analysis of the asymmetric shortest queue problem , 1991, Queueing Syst. Theory Appl..

[2]  P. Patrick Wang,et al.  Workload distribution of discrete‐time parallel queues with two servers , 2000 .

[3]  S. Turner,et al.  A join the shorter queue model in heavy traffic , 2000, Journal of Applied Probability.

[4]  G. J. Foschini,et al.  A Basic Dynamic Routing Problem and Diffusion , 1978, IEEE Trans. Commun..

[5]  Onno Boxma,et al.  Boundary value problems in queueing system analysis , 1983 .

[6]  D. McDonald,et al.  Overloading Parallel Servers when Arrivals Join the Shortest Queue , 1996 .

[7]  C. Graham.  Chaoticity on path space for a queueing network with selection of the shortest queue among several , 2000, Journal of Applied Probability.

[8]  Morton J. M. Posner,et al.  A level-crossing approach to the solution of the shortest-queue problem , 1997, Oper. Res. Lett..

[9]  Shlomo Halfin.  The shortest queue problem , 1985 .

[10]  Ivo J. B. F. Adan,et al.  Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism , 2001, OR Spectr..

[11]  C. Knessl.  A new heavy traffic limit for the asymmetric shortest queue problem , 1999, European Journal of Applied Mathematics.

[12]  D. McDonald,et al.  Join the shortest queue: stability and exact asymptotics , 2001 .

[13]  J. P. C. Blanc.  The Power-Series Algorithm Applied to the Shortest-Queue Model , 1992, Oper. Res..

[14]  Philip J. Fleming,et al.  HEAVY TRAFFIC APPROXIMATIONS FOR A SYSTEM OF INFINITE SERVERS WITH LOAD BALANCING , 1999, Probability in the Engineering and Informational Sciences.

[15]  Ivo J. B. F. Adan,et al.  Upper and lower bounds for the waiting time in the symmetric shortest queue system , 1994, Ann. Oper. Res..

[16]  Charles Knessl,et al.  On the infinite server shortest queue problem: Non-symmetric case , 2006, Queueing Syst. Theory Appl..

[17]  Ivo J. B. F. Adan,et al.  Analysis of the symmetric shortest queue problem , 1990 .

[18]  Ivo J. B. F. Adan,et al.  Matrix-geometric analysis of the shortest queue problem with threshold jockeying , 1993, Oper. Res. Lett..

[19]  Martin I. Reiman,et al.  Some diffusion approximations with state space collapse , 1984 .

[20]  J. Kingman.  Two Similar Queues in Parallel , 1961 .

[21]  Ali Sharifnia,et al.  Instability of the Join-the-Shortest-Queue and FCFS Policies in Queueing Systems and Their Stabilization , 1997, Oper. Res..

[22]  P. Sparaggis,et al.  Minimizing response times and queue lengths in systems of parallel queues , 1999 .

[23]  Charles Knessl,et al.  Two Parallel Queues with Dynamic Routing , 1986, IEEE Trans. Commun..

[24]  J. Hunter.  Two Queues in Parallel , 1969 .

[25]  van Gjjan Geert-Jan Houtum,et al.  New approaches for multi-dimensional queueing systems , 1995 .

[26]  Vidyadhar G. Kulkarni,et al.  Optimal control of two parallel infinite-server queues , 1990, 29th IEEE Conference on Decision and Control.

[27]  Winfried K. Grassmann,et al.  The shortest queue model with jockeying , 1990 .

[28]  Ilya Gertsbakh,et al.  The shorter queue problem: A numerical study using the matrix-geometric solution☆ , 1984 .

[29]  Charles Knessl,et al.  Exact and asymptotic solutions to a PDE that arises in time-dependent queues , 2000, Advances in Applied Probability.

[30]  Charles Knessl,et al.  Two Parallel M/G/1 Queues where Arrivals Join the System with the Smaller Buffer Content , 1987, IEEE Trans. Commun..