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

Share/Save/Bookmark

Doorn, Erik A. van and Panken, Frans J.M. (1993) Blocking probabilities in a loss system with arrivals in geometrically distributed batches and heterogeneous service requirements. IEEE/ACM Transactions on Networking, 1 (6). pp. 664-667. ISSN 1063-6692

open access
[img]
Preview
PDF
299kB
Abstract: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
Item Type:Article
Copyright:© 1993 IEEE
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/30049
Official URL:http://dx.doi.org/10.1109/90.266054
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 140688