—Two paths between a source node and a destination node in a network are node- disjoint if they do not share any nodes except the end points. Node-disjoint paths have numerous uses in distributed systems including ways to deal with lost, damaged or altered messages during delivery. Many topologies such as hypercube, star networks, and their variants have been proposed, providing multiple disjoint paths between a pair of endpoints. The exchanged hypercube is a new topology that is obtained by systematically removing edges from a binary hypercube. Exchanged hypercube topology increases scalability and relative cost of the networks by reducing the number of edges per node. In this paper, we propose a distributed algorithm that is both stabilizing and inherently stabilizing to route messages over all node-disjoint paths in an exchanged hypercube network.
—Distributed algorithms, exchanged hypercube, node-disjoint paths, stabilization.
Thamer Alsulaiman is with the University of Iowa, 14 MacLean Hall, Iowa City, IA 52242-1419, US (email: firstname.lastname@example.org).
Mehmet HakanKaraata is with Kuwait University, Safat 13090, Khaldiya, Kuwait (e-mail: email@example.com).
Cite:Thamer Alsulaiman and Mehmet Hakan Karaata, "An Optimal Inherently Stabilizing Algorithm for Routing over All Node-Disjoint Paths in Exchanged Hypercubes," Journal of Advances in Computer Networks vol. 3, no. 1, pp. 32-37, 2015.