Dynamic routing algorithms in ATM networks

In our previous work, we elaborated the multistage virtual path (VP) control strategy and the VP topology optimization problem in which we assume a set of alternative routes exist between each source-destination (SD) pair. In the first part of this paper, a supplementary algorithm, which can yield all possible routes between two nodes and can be used for general routing problems, is provided. Based this algorithm, a dynamic VC routing policy is studied. The proposed policy distinguishes from other strategies in that it is considered in a generic networking environment. In the last part of this paper, we present a dynamic VP routing algorithm which is an important component of the dynamic VC routing policy. Detailed analyses and experimental results demonstrate these algorithms are correct, practical and useful