Abstract
The paper investigates the asymptotic behavior of almost surely maximum length in queueing systems. For a system M / M / m, 1≤ m< ∞, a statement of the type of the law of iterated logarithm is established. We also consider the case m = ∞ for which the asymptotic behavior is much different.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have