Blocking probabilities in multitraffic loss systems: insensitivity, asymptotic behavior, and approximations
- 1 January 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 40 (8), 1355-1366
- https://doi.org/10.1109/26.156640
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The stochastic knapsack problemIEEE Transactions on Communications, 1989
- An asymptotic analysis of complete sharing policyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blockingAdvances in Applied Probability, 1987
- Blocking probabilities in large circuit-switched networksAdvances in Applied Probability, 1986
- Insensitivity of blocking probabilities in a circuit-switching networkJournal of Applied Probability, 1984
- Sharing Memory OptimallyIEEE Transactions on Communications, 1983
- Blocking in a Shared Resource EnvironmentIEEE Transactions on Communications, 1981
- A Multi-User-Class, Blocked-Calls-Cleared, Demand Access ModelIEEE Transactions on Communications, 1978
- Queuing Networks with Population Size ConstraintsIBM Journal of Research and Development, 1977
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975