Masahiro Kobayashi
Abstract
We consider a parallel queueing model which has k identical servers. Assume that customers arrive from outside according to a Poisson process and join the shortest queue. Their service times have an i.i.d. exponential distribution, which is referred to as an M/MJSQ with k parallel queues. We are interested in the asymptotic behavior of the stationary distribution for the shortest queue length of this model, provided the stability is assumed. For this stationary distribution, it can be guessed conjectured that the tail decay rate is given by the k-th power of the traffic intensity of the corresponding M/M/k queue with a single waiting line. We prove this fact by obtaining the exactly geometric asymptotics. For this, we use two formulations. One is a quasi-birth-and-death (QBD for short) process which is typically used, and the other is a reflecting random walk on the boundary of the k + 1-dimensional orthant which is a key for our proof.
Recommendations
Tail asymptotics of the waiting time and the busy period for the $${{\varvec{M/G/1/K}}}$$ queues with subexponential service times
We study the asymptotic behavior of the tail probabilities of the waiting time and the busy period for the $$M/G/1/K$$ queues with subexponential service times under three different service disciplines: FCFS, LCFS, and ROS. Under the FCFS discipline, the result on ...
Tail asymptotics for the queue length in an M/G/1 retrial queue
In this paper, we study the tail behavior of the stationary queue length of an M/G/1 retrial queue. We show that the subexponential tail of the stationary queue length of an M/G/1 retrial queue is determined by that of the corresponding M/G/1 queue, and ...
Tail asymptotics for waiting time distribution of an M/M/s queue with general impatient time
QTNA '10: Proceedings of the 5th International Conference on Queueing Theory and Network ApplicationsIn this paper, we consider an M/M/s queue where customers may abandon waiting for service and renege the system without receiving their services. We assume that impatient time on waiting for each customer is independent and identically distributed non-...
Comments