On the Shortest Queue Version of the Erlang Loss Model.

We consider two parallel M/ M/ N/ N queues. Thus there are N servers in each queue and no waiting line(s). The network is fed by a single Poisson arrival stream of rate λ, and the 2 N servers are identical exponential servers working at rate μ. A new arrival is routed to the queue with the smaller number of occupied servers. If both have the same occupancy then the arrival is routed randomly, with the probability of joining either queue being 1/2. This model may be viewed as the shortest queue version of the classic Erlang loss model. If all 2 N servers are occupied further arrivals are turned away and lost. We let and . We study this model both numerically and asymptotically. For the latter we consider heavily loaded systems (ρ→∞) with a comparably large number of servers ( with . We obtain asymptotic approximations to the joint steady state distribution of finding m servers occupied in the first queue and n in the second. We also consider the marginal distribution of the number of occupied servers in the second queue, as well as some conditional distributions. We show that aspects of the solution are much different according as or . The asymptotic approximations are shown to be quite accurate numerically. [ABSTRACT FROM AUTHOR]