|
Problemy Peredachi Informatsii, 2018, Volume 54, Issue 2, Pages 86–102
(Mi ppi2268)
|
|
|
|
This article is cited in 4 scientific papers (total 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.
Received: 13.04.2017 Revised: 21.07.2017
Citation:
A. V. Lebedev, “Maximum remaining service time in infinite-server queues”, Probl. Peredachi Inf., 54:2 (2018), 86–102; Problems Inform. Transmission, 54:2 (2018), 176–190
Linking options:
https://www.mathnet.ru/eng/ppi2268 https://www.mathnet.ru/eng/ppi/v54/i2/p86
|
Statistics & downloads: |
Abstract page: | 311 | Full-text PDF : | 64 | References: | 45 | First page: | 11 |
|