On Disjoint Shortest Paths Routing on the Hypercube

Authors:
Eddie Cheng;Shuhong Gao;Ke Qiu;Zhizhang Shen
Affiliations:
Dept. of Mathematics and Statistics, Oakland University, USA;Dept. of Mathematical Science, Clemson University, USA;Dept. of Computer Science, Brock University, Canada;Dept. of Computer Science and Technology, Plymouth State University, USA
Venue:
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Year:
2009

Citing 8
Cited 2

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
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
An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes

Journal of Parallel and Distributed Computing
Nearly Optimal One-to-Many Parallel Routing in Star Networks

IEEE Transactions on Parallel and Distributed Systems
n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices

Parallel Computing
An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube

ICPADS '08 Proceedings of the 2008 14th IEEE International Conference on Parallel and Distributed Systems

Two conditions for reducing the maximal length of node-disjoint paths in hypercubes

Theoretical Computer Science
One-to-many node-disjoint paths of hyper-star networks

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a routing algorithm that finds n disjoint shortest paths from the source node to n target nodes in the n -dimensional hypercube in O (n 3) = O (log3 N ) time, where N = 2 n , provided that such disjoint shortest paths exist which can be verified in O (n 5/2) time, improving the previous O (n 3 logn ) routing algorithm. In addition, the development of this algorithm also shows strong relationship between the problems of the disjoint shortest paths routing and matching.