Parallel Routing in Hypercube Networks with Faulty Nodes

Authors:
Affiliations:
Venue:
ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
Year:
2001

Citing 0
Cited 3

On strong Menger-connectivity of star graphs

Discrete Applied Mathematics
Improving the dependability of prefix-based routing in DHTs

OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
HyPeer: Structured overlay with flexible-choice routing

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: The concept of strong fault-tolerance was introduced to characterize the property of parallel routing [15]. A network G of degree d is said strongly fault-tolerant if with at most d - 2 faulty nodes, any two nodes u and v in G are connected by minfdegf (u); degf (v)g node-disjoint paths, where degf (u) and degf (v) are the numbers of non-faulty neighbors of the nodes u and v in G, respectively. We show that the hypercube networks are strongly fault-tolerant and develop an algorithm that constructs the maximum number of node-disjoint paths in a hypercube network with faults. Our algorithm is optimal in terms of time and length of node-disjoint paths.