An asymptotic analysis of complete sharing policy
- 1 January 1989
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1038-1046 vol.3
- https://doi.org/10.1109/infcom.1989.101556
Abstract
A model is considered which has several classes of customers arriving in independent Poisson processes at a multiserver facility and requiring a specific number of servers for a random period of time (arbitrarily distributed with a finite mean). If these servers cannot be provided, the customers are cleared. The problem is to determine the blocking probabilities. The exact expression is available but is complicated. The authors apply a novel approximation method of ensemble averaging for the asymptotic analysis of blocking in such systems. The method gives simple expressions for the average performance measures without an explicit computation of the normalization constant of the steady-state probability distribution. The computation of blocking probability and of other performance measures is reduced to computing a root of a simple algebraic equation. The obtained expressions are shown to be asymptotically correct.Keywords
This publication has 14 references indexed in Scilit:
- Blocking probabilities in large circuit-switched networksAdvances in Applied Probability, 1986
- Blocking When Service Is Required From Several Facilities SimultaneouslyAT&T Technical Journal, 1985
- Buffer allocation strategies with blocking requirementsPerformance Evaluation, 1984
- Capacity Allocation in a DAMA Satellite SystemIEEE Transactions on Communications, 1982
- Blocking in a Shared Resource EnvironmentIEEE Transactions on Communications, 1981
- A Queueing System in Which Customers Require a Random Number of ServersOperations Research, 1980
- Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic ConditionsIEEE Transactions on Communications, 1980
- A Multi-User-Class, Blocked-Calls-Cleared, Demand Access ModelIEEE Transactions on Communications, 1978
- Store-and-Forward Buffer Requirements in a Packet Switching NetworkIEEE Transactions on Communications, 1976
- Analysis of Mixtures of Wide- and Narrow-Band TrafficIEEE Transactions on Communications, 1965