Abstract
For a service system with an infinite number of servers, Poisson arrivals, and negative exponentially distributed service times, this note considers various taboo probabilities, and derives an expression for the probability distribution of the maximum number y of customers simultaneously present during a busy cycle. It turns out that the expression for pr{y = n ∣ y ≧ n} is, in a certain sense, dual to Erlang's loss formula.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
