Fault tolerant routing in toroidal networks

Authors:
Qian-Ping Gu;Shietung Peng
Affiliations:
-;-
Venue:
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Year:
1995

Citing 7
Cited 0

Topological Properties of Hypercubes

IEEE Transactions on Computers
Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
Algorithmic graph theory

Algorithmic graph theory
VLSI and parallel computation

VLSI and parallel computation
Concentrated regular data streams on grids: sorting and routing near to the bisection bound

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Optimal routing in toroidal networks

Information Processing Letters
Optimal Multi-Packet Routing on the Torus

SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an O(r/sup 2/) time algorithm for constructing a fault-free routing path of optimal length between any true non-fault nodes of an r-dimensional torus with 2r-1 faulty nodes. We show that the Rabin diameter of a r-dimensional torus is its diameter plus one. We also describe a cluster fault tolerant (CFT) routing model and give an efficient algorithm for node-to-node CFT routing.