Implicit representation of graphs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
An optimal synchronizer for the hypercube
SIAM Journal on Computing
Compact distributed data structures for adaptive routing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
Efficient algorithms for constructing fault-tolerant geometric spanners
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Balancing minimum spanning and shortest path trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
All-Pairs Almost Shortest Paths
SIAM Journal on Computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Compact labeling schemes for ancestor queries
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Labeling schemes for small distances in trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Informative Labeling Schemes for Graphs
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
New Results of Fault Tolerant Geometric Spanners
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Proximity-Preserving Labeling Schemes and Their Applications
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Deterministic Polylog Approximation for Minimum Communication Spanning Trees
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Fault-Tolerant Geometric Spanners
Discrete & Computational Geometry
Journal of the ACM (JACM)
Spanners and emulators with sublinear distance errors
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Sparse Distance Preservers and Additive Spanners
SIAM Journal on Discrete Mathematics
Approximate distance oracles for unweighted graphs in expected O(n2) time
ACM Transactions on Algorithms (TALG)
Planning for Fast Connectivity Updates
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Oracles for Distances Avoiding a Failed Node or Link
SIAM Journal on Computing
Network decomposition and locality in distributed computation
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
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
Dual-failure distance and connectivity oracles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A nearly optimal oracle for avoiding failed vertices and edges
Proceedings of the forty-first annual ACM symposium on Theory of computing
Fault-tolerant spanners for general graphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Deterministic constructions of approximate distance oracles and spanners
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Hi-index | 0.00 |
Consider a logical structure ${\cal S}$, constructed over a given network G , which is intended to efficiently support various services on G . This logical structure is supposed to possess certain desirable properties, measured with respect to G and represented by some requirement predicate ${\cal P}({\cal S},G)$. Now consider a failure event F affecting some of the network's vertices and edges. Making ${\cal S}$ fault-tolerant means reinforcing it so that subsequent to the failure event, its surviving part ${\cal S}'$ continues to satisfy ${\cal P}$. One may insist on imposing the requirements with respect to the original network G , i.e., demanding that the surviving structure ${\cal S}'$ satisfies the predicate ${\cal P}({\cal S}',G)$. The idea behind competitive fault tolerance is that it may sometimes be more realistic and more productive to evaluate the performance of the surviving ${\cal S}'$ after the failure event not with respect to G (which at the moment is no longer in existence anyway), but rather with respect to the surviving network G *** = G *** F , which in a sense is the best one can hope for. Hence, we say that the structure ${\cal S}$ enjoys competitive fault-tolerance if subsequent to a failure event F , its surviving part ${\cal S}'$ satisfies the requirement predicate ${\cal P}({\cal S}',G')$. The paper motivates the notion of competitive fault tolerance, compares it with the more demanding alternative approach, and illustrates it on a number of representative examples.