An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks
Issue No. 07 - July (2010 vol. 59)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2010.76
Ozgur Sinanoglu , Kuwait University, Safat
Mehmet Hakan Karaata , Kuwait University, Safat
Bader AlBdaiwi , Kuwait University, Safat
The node-disjoint paths problem deals with finding node-disjoint paths from a source node s to target node t, where t \ne s. Two paths from s to t are said to be node-disjoint iff they do not have any common vertices except for their endpoints. Distributed solutions to the node-disjoint paths problem have numerous applications such as secure message transmission, reliable routing, and network survivability. In this paper, we present a simple distributed algorithm that is both stabilizing and inherently stabilizing under a realistic model that describes system interfaces and implementation issues in detail to route messages over all shortest node-disjoint paths from one process to another in an n-dimensional hypercube network.
Fault-tolerance, hypercube networks, stabilization, inherent stabilization, node-disjoint paths.
B. AlBdaiwi, M. H. Karaata and O. Sinanoglu, "An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks," in IEEE Transactions on Computers, vol. 59, no. , pp. 995-999, 2010.