M/M/$c$ Queues and the Poisson Clumping Heuristic
History and Overview
2019-04-09 v1 Probability
Abstract
In continuous time, customers arrive at random. Each waits until one of servers is available; each thereafter departs at random. The distribution of maximum line length of idle customers was studied over 25 years ago. We revisit two good approximations of this, employing a discrete Gumbel formulation and detailed graphics to describe simulation outcomes.
Keywords
Cite
@article{arxiv.1904.04054,
title = {M/M/$c$ Queues and the Poisson Clumping Heuristic},
author = {Steven Finch},
journal= {arXiv preprint arXiv:1904.04054},
year = {2019}
}
Comments
12 pages, 10 figures