Losses in M/GI/m/n Queues

Abstract

The M/GI/m/n queueing system with m homogeneous servers and the finite number n of waiting spaces is studied. Let λ be the customers arrival rate, and let μ be the reciprocal of the expected service time of a customer. Under the assumption λ=mμ it is proved that the expected number of losses during a busy period is the same value for all n≥1, while in the particular case of the Markovian system M/M/m/n the expected number of losses during a busy period is mmm! for all n≥0. Under the additional assumption that the probability distribution function of a service time belongs to the class NBU or NWU, the paper establishes simple inequalities for those expected numbers of losses in M/GI/m/n queueing systems.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…