Computational algorithms for blocking probabilities in circuit-switched networks
- 1 February 1992
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 35 (1) , 31-41
- https://doi.org/10.1007/bf02023089
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Mean value analysis by chain of product form queueing networksIEEE Transactions on Computers, 1989
- Congestion probabilities in a circuit-switched integrated services networkPerformance Evaluation, 1987
- RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networksJournal of the ACM, 1986
- A New Method For Computing The Normalization Constant Of Multiple-Chain Queueing NetworksINFOR: Information Systems and Operational Research, 1986
- Insensitivity of blocking probabilities in a circuit-switching networkJournal of Applied Probability, 1984
- Sharing Memory OptimallyIEEE Transactions on Communications, 1983
- Capacity Allocation in a DAMA Satellite SystemIEEE Transactions on Communications, 1982
- LinearizerCommunications of the ACM, 1982
- A Multi-User-Class, Blocked-Calls-Cleared, Demand Access ModelIEEE Transactions on Communications, 1978
- Analysis of Channel Utilization in Traffic ConcentratorsIEEE Transactions on Communications, 1974