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

Probl. Peredachi Inf., 2018 Volume 54, Issue 2, Pages 86–102 (Mi ppi2268)

This article is cited in 4 papers

Communication Network Theory

Maximum remaining service time in infinite-server queues

A. V. Lebedev

Department of Probability Theory, Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, Moscow, Russia

Abstract: We study the maximum remaining service time in infinite-server queues of type $M|G|\infty$ (at a given time and in a stationary regime). The following cases for the arrival flow rate are considered: (1) time-independent, (2) given by a function of time, (3) given by a random process. As examples of service time distributions, we consider exponential, hyperexponential, Pareto, and uniform distributions. In the case of a constant rate, we study effects that arise when the average service time is infinite (for power-law distribution tails). We find the extremal index of the sequence of maximum remaining service times. The results are extended to queues of type $M^X|G|\infty$, including those with dependent service times within a batch.

UDC: 621.391.1+519.21

Received: 13.04.2017
Revised: 21.07.2017


 English version:
Problems of Information Transmission, 2018, 54:2, 176–190

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024