Graph Algorithms
Graphs and Hypergraphs
On fault tolerant routings in general networks
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Reconfiguring a hypercube in the presence of faults
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
An optimal synchronizer for the hypercube
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Fast computation using faulty hypercubes
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Concurrent Processing of Linearly Ordered Data Structures on Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Chain decompositions and independent trees in 4-connected graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Edge-Bisection of Chordal Rings
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Uniform multi-hop all-to-all optical routings in rings
Theoretical Computer Science - Latin American theoretical informatics
Fault-tolerant clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
A general approach for all-to-all routing in multihop WDM optical networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Consider a communication network G in which a limited number of link and/or node faults F might occur. A routing &rgr; for the network (a fixed path between each pair of nodes) must be chosen without any knowledge of which components might become faulty. Choosing a good routing corresponds to bounding the diameter of the surviving route graph R(G,&rgr;)/F, where two nonfaulty nodes are joined by an edge if there are no faults on the route between them. We prove a number of results concerning the diameter of surviving route graphs. We show that if &rgr; is a minimal length routing, then the diameter of R(G,&rgr;)/F can be on the order of the number of nodes of G, even if F consists of only a single node. However, if G is the n-dimensional cube, the diameter of R(G,&rgr;)/F≤3 for any minimal length routing &rgr; and any set of faults F with |F|