Blocking evaluation for networks with residual capacity adaptive routing

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.>