Fault tolerance of minimal path routings in a network

Authors:
P Feldman
Affiliations:
Harvard University, Cambridge, Massachusetts
Venue:
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Year:
1985

Citing 0
Cited 4

On fault tolerant routings in general networks

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs

WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables

WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
A journey into multicomputer routing algorithms

PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis

Quantified Score

Hi-index	0.01

Visualization

Abstract

We prove the conjectured 2T-1 pound on the diameter of a surviving quote graph from which T edges are removed, under the assumption that a minimal path routing is used we also prove the related conjecture for node failure, and combine the results into a more general theorem.