Dynamic routing algorithm in ATM networks

In accordance with the multistage virtual path (VP) control and the VP topology optimization problem, and the optimizing algorithm based on the assumption that a set of alternative routes exist between each source-destination (SD) pair discussed in the previous work, a supplementary algorithm, which can yield all possible routes between two nodes, is presented. Moreover, a dynamic VC routing policy is studied. This policy differs from other strategies because it is considered in a more general networking environment. Finally, a dynamic VP routing algorithm as an important component of the VC routing policy is provided. Theoretical and experimental analyses demonstrate that these algorithms are correct and have the high practical value.