M/M/c Queues and the Poisson Clumping Heuristic
classification
🧮 math.HO
math.PR
keywords
customersrandomapproximationsarriveavailableclumpingcontinuousdeparts
read the original abstract
In continuous time, customers arrive at random. Each waits until one of $c$ 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.