RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2003 Volume 39, Issue 3, Pages 87–94 (Mi ppi310)

This article is cited 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.

UDC: 519.872

Received: 07.06.2002


 English version:
Problems of Information Transmission, 2003, 39:3, 309–316

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024