2000 character limit reached
M/M/$c$ Queues and the Poisson Clumping Heuristic (1904.04054v1)
Published 8 Apr 2019 in math.HO and math.PR
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.