Abstract
The setting considered in this talk is that of a structure S constructed over a given network G and intended to efficiently support some service on it (e.g., a distributed database or a query-answering oracle.) Such a structure is required to ensure certain desirable properties with respect to G. However, a failure event F might damage some of the network’s vertices and edges, and cause S to malfunction. We are interested in ways of making S fault-tolerant, namely, reinforcing it so that following a failure event, its surviving part continues to satisfy the requirements. The talk will distinguish between two types of fault-tolerance, termed rigid and competitive fault tolerance, compare these two notions, and illustrate them on a number of examples.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peleg, D. (2012). Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 2012. Lecture Notes in Computer Science, vol 7551. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34611-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-34611-8_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34610-1
Online ISBN: 978-3-642-34611-8
eBook Packages: Computer ScienceComputer Science (R0)