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

Authors:
Ozgur Sinanoglu;Mehmet Hakan Karaata;Bader AlBdaiwi
Affiliations:
Kuwait University, Safat;Kuwait University, Safat;Kuwait University, Safat
Venue:
IEEE Transactions on Computers
Year:
2010

Citing 0
Cited 2

An evolutionary algorithm for broadcast scheduling in wireless multihop networks

Wireless Networks
Node-disjoint paths in a level block of generalized hierarchical completely connected networks

Theoretical Computer Science

Quantified Score

Hi-index	14.98

Visualization

Abstract

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.