Blocking evaluation for networks with residual capacity adaptive routing
Authors:
- A. GirardAGA. Girard
- M.-A. BellMBM.-A. Bell
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 37 (12) , 1372-1380
Abstract
An algorithm is proposed for obtaining conservative estimates for the end-to-end blocking probability of networks operating with residual capacity adaptive routing. Two important requirements are that it should be fast enough for use within an iterative network design procedure and have an accuracy sufficient for that purpose. The algorithm is based on the assumption that the stationary behavior of residual capacity adaptive routing can be adequately modeled by a nonadaptive routing with suitably chosen parameters. An algorithm is proposed for the stationary version that is stable and fast but overestimates the blocking. A number of modifications of the model to improve its accuracy are examined. It is concluded that the model can be used for network design if a conservative solution is acceptable. >Keywords
This publication has 7 references indexed in Scilit:
- Blocking Probability of Noninteger Groups with Trunk ReservationIEEE Transactions on Communications, 1985
- The Overload Performance of Engineered Networks With Nonhierarchical and Hierarchical RoutingAT&T Bell Laboratories Technical Journal, 1984
- Servicing and Real-Time Control of Networks With Dynamic RoutingBell System Technical Journal, 1981
- Design and Optimization of Networks With Dynamic RoutingBell System Technical Journal, 1981
- A Unified Approximate Evaluation of Congestion Functions for Smooth and Peaky TrafficsIEEE Transactions on Communications, 1981
- Analysis of Circuit-Switched Networks Employing Originating-Office Control with Spill-ForwardIEEE Transactions on Communications, 1978
- Analysis of Dependence Effects in Telephone Trunking NetworksBell System Technical Journal, 1971