|
Problemy Peredachi Informatsii, 1996, Volume 32, Issue 1, Pages 20–34
(Mi ppi298)
|
|
|
|
This article is cited in 116 scientific papers (total in 117 papers)
Queueing System with Selection of the Shortest of Two Queues: An Asymptotic Approach
N. D. Vvedenskaya, R. L. Dobrushin, F. I. Karpelevich
Abstract:
Consider a system that consists of $N$ servers with a Poisson input flow of demands of intensity $N\lambda$. Each demand arriving to the system randomly selects two servers and is instantly sent to the one with the shorter queue. The service time is distributed exponentially with mean 1. It turns out that for $\lambda<1$ it is possible to investigate the asymptotic distribution of the queue lengths as $N\to\infty$. In the limit the queue length probability decreases superexponentially as the queue length increases.
Citation:
N. D. Vvedenskaya, R. L. Dobrushin, F. I. Karpelevich, “Queueing System with Selection of the Shortest of Two Queues: An Asymptotic Approach”, Probl. Peredachi Inf., 32:1 (1996), 20–34; Problems Inform. Transmission, 32:1 (1996), 15–27
Linking options:
https://www.mathnet.ru/eng/ppi298 https://www.mathnet.ru/eng/ppi/v32/i1/p20
|
Statistics & downloads: |
Abstract page: | 4000 | Full-text PDF : | 1571 | First page: | 2 |
|