A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Improved routing strategies with succinct tables
Journal of Algorithms
Memory requirement for universal routing schemes
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Compact routing with minimum stretch
Journal of Algorithms
Space-efficiency for routing schemes of stretch factor three
Journal of Parallel and Distributed Computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Compact routing schemes with low stretch factor
Journal of Algorithms
New data structures for orthogonal range searching
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Journal of the ACM (JACM)
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Fast algorithms for constructing t-spanners and paths with stretch t
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Connectivity oracles for failure prone graphs
Proceedings of the forty-second ACM symposium on Theory of computing
Forbidden-set distance labels for graphs of bounded doubling dimension
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
f-sensitivity distance Oracles and routing schemes
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
This paper considers compact fault-tolerant routing schemes for weighted general graphs, namely, routing schemes that avoid a set of failed (or forbidden) edges. We present a compact routing scheme capable of handling multiple edge failures. Assume a source node s contains a message M designated to a destination target t and assume a set F of edges crashes (unknown to s). Our scheme routes the message to t (provided that s and t are still connected in G \ F) over a path whose length is proportional to the distance between s and t in G \ F, to |F|3 and to some poly-log factor. The routing table required at a node v is of size proportional to the degree of v in G and some poly-log factor. This improves on the previously known fault-tolerant compact routing scheme for general graphs, which was capable of overcoming at most 2 edge failures.