|
Problemy Peredachi Informatsii, 2003, Volume 39, Issue 3, Pages 87–94
(Mi ppi310)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Communication Network Theory
The Gated Infinite-Server Queue with Unbounded Service Times and
Heavy Traffic
A. V. Lebedev M. V. Lomonosov Moscow State University
Abstract:
A queueing system with infinitely many servers is considered where access of customers to service is controlled by a gate. The gate is open only if all servers are free. Customers are served in stages. We study the asymptotic behavior of the number of customers served in a stage and of the stage duration in the heavy traffic regime in the case where the service time distribution belongs to the attraction domain of a double exponential law.
Received: 07.06.2002
Citation:
A. V. Lebedev, “The Gated Infinite-Server Queue with Unbounded Service Times and
Heavy Traffic”, Probl. Peredachi Inf., 39:3 (2003), 87–94; Problems Inform. Transmission, 39:3 (2003), 309–316
Linking options:
https://www.mathnet.ru/eng/ppi310 https://www.mathnet.ru/eng/ppi/v39/i3/p87
|
Statistics & downloads: |
Abstract page: | 244 | Full-text PDF : | 85 | References: | 43 | First page: | 1 |
|