A Self-stabilizing One-To-Many Node Disjoint Paths Routing Algorithm in Star Networks

Abstract

The purpose of the paper is to present the first self-stabilizing algorithm for finding n−1 one-to-many node-disjoint paths in message passing model. Two paths in a network are said to be node disjoint if they do not share any nodes except for the endpoints. Our proposed algorithm works on n-dimensional star networks Sn. Given a source node s and a set of D = {d1, d2, ..., dn−1} of n − 1 destination nodes in the n-dimensional star network, our algorithm constructs n − 1 node-disjoints paths P1, P2, ..., Pn−1, where Pi is a path from s to di, 1 ≤ i ≤ n − 1. Since the proposed solution is self-stabilizing [7], it does not require initialization and withstands transient faults. The stabilization time of our algorithm is O(n 2 ) rounds.