Computing approximate blocking probabilities for large loss networks with state-dependent routing
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 1 (1) , 105-115
- https://doi.org/10.1109/90.222911
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- Synchronous relaxation for parallel simulations with applications to circuit-switched networksACM Transactions on Modeling and Computer Simulation, 1993
- State-dependent routing on symmetric loss networks with trunk reservations. IIEEE Transactions on Communications, 1993
- Separable routing: A scheme for state-dependent routing of circuit switched telephone trafficAnnals of Operations Research, 1992
- State-dependent routing on symmetric loss networks with trunk reservations. II: Asymptotics, optimal designAnnals of Operations Research, 1992
- Loss NetworksThe Annals of Applied Probability, 1991
- Algorithms to determine exact blocking probabilities for multirate tree networksIEEE Transactions on Communications, 1990
- Limit theorems for loss networks with diverse routingAdvances in Applied Probability, 1989
- Implied costs in loss networksAdvances in Applied Probability, 1989
- Blocking evaluation for networks with residual capacity adaptive routingIEEE Transactions on Communications, 1989
- Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blockingAdvances in Applied Probability, 1987