Join the shortest queue among \(k\) parallel queues: tail asymptotics of its stationary distribution (Q1955512)

The authors consider a queueing system with \(k\geq 3\) queues, Poisson arrivals and exponentially distributed service time. Each queue has a single server and newly entering customers join the shortest queue. The point of interest is in the queue length for such system. The authors intend to prove the following conjecture: the tail decay rate of stationary distribution for the minimum queue length is the \(k\)th power of traffic intensity of the corresponding \(k\) server queue with a single waiting line, and the asymptotic for the minimum queue length is geometric.