Blocking probabilities in a loss system with arrivals in geometrically distributed batches and heterogeneous service requirements

The authors analyze a generalization of the classical Erlang loss model. Customers of several types contend for access to a service facility consisting of a finite number of servers. Each customer requires a fixed number of servers simultaneously during an exponentially distributed service time, and is blocked on arrival if this requirement cannot be met. Customers of each type arrive in geometrically distributed batches, while the arrival of batches of each type is governed by a Poisson process. All relevant parameters may be type-dependent. The authors obtain the steady-state distribution of the number of customers of each type in the system (which turns out to have product form) and the blocking probabilities experienced by each customer type. In addition, the authors bring to light the connection between the model at hand and a method is proposed by L.E.N. Delbrouck (1983) for estimating blocking probabilities in an incompletely specified setting.<
>