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


Abstmct-We 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… (More)
DOI: 10.1109/90.266054


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics