n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices

Authors:
Teofilo F. Gonzalez;David Serena
Affiliations:
Department of Computer Science, University of California at Santa Barbara, Santa Barbara, CA 95064, United States;Department of Computer Science, University of California at Santa Barbara, Santa Barbara, CA 95064, United States
Venue:
Parallel Computing
Year:
2004

Citing 4
Cited 3

Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes

IEEE Transactions on Computers
Node-to-set and set-to-set cluster fault tolerant routing in hypercubes

Parallel Computing
From Hall's matching theorem to optimal routing on hypercubes

Journal of Combinatorial Theory Series B

Pairwise edge disjoint shortest paths in the n-cube

Theoretical Computer Science
On Disjoint Shortest Paths Routing on the Hypercube

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In parallel and distributed systems many communications take place concurrently, so the routing algorithm as well as the underlying interconnection network play a vital role in delivering all the messages efficiently. Fault tolerance and performance are often obtained by delivering the messages through node disjoint shortest paths. In this paper we present two efficient algorithms to construct, under certain conditions, pairwise node disjoint shortest paths for pairs of vertices in an n-cube in the presence of faulty nodes. The first algorithm has O(m^2) time complexity, where m is the number of input bits, and the second one takes O(m^3), but it solves more general problem instances. We also present an efficient algorithm for the extreme version of the edge disjoint shortest paths problem when n is odd.