An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks

The node-disjoint paths problem deals with finding node-disjoint paths from a source node s to target node t, where t ¿ 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.

[1]  Nachum Shacham,et al.  Distributed algorithms for computing shortest pairs of disjoint paths , 1993, IEEE Trans. Inf. Theory.

[2]  Xiaoping Liu,et al.  A solution to the three disjoint path problem on honeycomb meshes , 2004, Parallel Process. Lett..

[3]  Ahmed E. Kamal,et al.  OPN04-3: 1+N Protection in Mesh Networks Using Network Coding over p-Cycles , 2006, IEEE Globecom 2006.

[4]  Serge A. Plotkin.  Competitive Routing of Virtual Circuits in ATM Networks , 1995, IEEE J. Sel. Areas Commun..

[5]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[6]  Stefan Decker,et al.  Ontologies and efficient search on p2p networks , 2002 .

[7]  Bella Bose,et al.  All-to-All Broadcasting in Faulty Hypercubes , 1997, IEEE Trans. Computers.

[8]  Yvo Desmedt,et al.  Perfectly Secure Message Transmission , 2011, Encyclopedia of Cryptography and Security.

[9]  Zhong Liu,et al.  A Hyper-cube based P2P Information Service for Data Grid , 2006, 2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06).

[10]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[11]  Ajoy Kumar Datta,et al.  State-optimal snap-stabilizing PIF in tree networks , 1999, Proceedings 19th IEEE International Conference on Distributed Computing Systems.

[12]  Ming-Syan Chen,et al.  Adaptive Fault-Tolerant Routing in Hypercube Multicomputers , 1990, IEEE Trans. Computers.

[13]  Shietung Peng,et al.  Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes , 1998, Parallel Comput..

[14]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[15]  Myung M. Bae,et al.  Edge Disjoint Hamiltonian Cycles in k-Ary n-Cubes and Hypercubes , 2003, IEEE Trans. Computers.

[16]  Moti Yung,et al.  Perfectly secure message transmission , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[17]  Shietung Peng,et al.  k-Pairwise Cluster Fault Tolerant Routing in Hypercubes , 1994, IEEE Trans. Computers.