Poisson arrivals of rate receive independent service times distributed as , with infinitely many servers so service starts on arrival. Starting empty, the occupancy at time is Poisson with mean , by independent thinning of the marked arrivals. If , the equilibrium count is Poisson with mean . Occupancy need not be a Markov process for a general service law; remaining service times carry additional state information.
Stop new arrivals at time in an initially empty general-service infinite-server queue. The number remaining time units later is Poisson with mean . Thus the probability that clearance has not occurred is one minus the exponential of the negative of that mean. Letting gives the displayed equilibrium formula, since . The clearance time is zero when no customers remain at closing.
Articles by others on the same topic
There are currently no matching articles.