|
Fundamentalnaya i Prikladnaya Matematika, 1996, Volume 2, Issue 4, Pages 1107–1115
(Mi fpm193)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Research Papers Dedicated to the Memory of B. V. Gnedenko
Asymptotic of maxima in the infinite server queue with bounded batch sizes
A. V. Lebedev M. V. Lomonosov Moscow State University
Abstract:
This paper considers the infinite server queue with the batch input $M^X|G|\infty$. Let all servers be free at time zero and $M(t)$ denote the maximum number of customers simultaneously present in the queue during $[0,t]$. The following theorem is proved.
Theorem 1.
If $L$ is the maximum number of customers in a batch, then almost sure
$$
M(t)\frac{\ln\ln t}{\ln t}\to L\quadas $t\to\infty$.\eqno (*)
$$
Some generalizations are discussed: nonstationary queues (with time-dependent parameters) and queues with heterogeneous customers. For these monotony theorems are proved. Conditions under which the asymptotic $(*)$ stays correct are obtained.
Received: 01.02.1996
Citation:
A. V. Lebedev, “Asymptotic of maxima in the infinite server queue with bounded batch sizes”, Fundam. Prikl. Mat., 2:4 (1996), 1107–1115
Linking options:
https://www.mathnet.ru/eng/fpm193 https://www.mathnet.ru/eng/fpm/v2/i4/p1107
|
Statistics & downloads: |
Abstract page: | 284 | Full-text PDF : | 101 | First page: | 2 |
|