Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, pp. 547–556 (2001)
Alstrup, S., Bille, P., Rauhe, T.: Labeling schemes for small distances in trees. In: Proc. 14th ACM-SIAM Symp. on Discrete Algorithms (2003)
Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Compact distributed data structures for adaptive network routing. In: Proc. 21st ACM Symp. on Theory of Computing, pp. 230–240 (1989)
Awerbuch, B., Baratz, A., Peleg, D.: Efficient broadcast and light-weight spanners. Unpublished manuscript (1991)
Awerbuch, B., Berger, B., Cowen, L., Peleg, D.: Fast network decomposition. In: Proc. 11th ACM Symp. on Principles of Distributed Computing, pp. 169–177 (1992)
Awerbuch, B., Goldberg, A., Luby, M., Plotkin, S.: Network decomposition and locality in distributed computation. In: Proc. 30th IEEE Symp. on Foundations of Computer Science, pp. 364–369 (1989)
Awerbuch, B., Kutten, S., Peleg, D.: On buffer-economical store-and-forward deadlock prevention. In: Proc. INFOCOM, pp. 410–414 (1991)
Awerbuch, B., Peleg, D.: Sparse partitions. In: 31st IEEE Symp. on Foundations of Computer Science, pp. 503–513 (1990)
Baswana, S., Sen, S.: Approximate distance oracles for unweighted graphs in expected O(n 2) time. ACM Trans. Algorithms 2(4), 557–577 (2006)
Bernstein, A., Karger, D.: A nearly optimal oracle for avoiding failed vertices and edges. In: Proc. 41st ACM Symp. on Theory of Computing, pp. 101–110 (2009)
Bollobás, B., Coppersmith, D., Elkin, M.: Sparse distance preservers and additive spanners. SIAM J. on Discr. Math. 19(4), 1029–1055 (2006)
Chechik, S., Langberg, M., Peleg, D., Roditty, L.: f-sensitivity distance oracles and routing schemes (June 2009) (manuscript)
Chechik, S., Langberg, M., Peleg, D., Roditty, L.: Fault-tolerant spanners for general graphs. In: Proc. 41st ACM Symp. on Theory of computing, pp. 435–444 (2009)
Chechik, S., Peleg, D.: Fault resilient network structures (2009) (in preparation)
Cohen, E.: Fast algorithms for constructing t-spanners and paths with stretch t. In: Proc. 34th IEEE Symp. on Foundations of Computer Science, pp. 648–658 (1993)
Courcelle, B., Twigg, A.: Compact forbidden-set routing. In: Proc. 24th Symp. on Theoretical Aspects of Computer Science, pp. 37–48 (2007)
Czumaj, A., Zhao, H.: Fault-tolerant geometric spanners. Discrete & Computational Geometry 32 (2003)
Demetrescu, C., Thorup, M., Chowdhury, R., Ramachandran, V.: Oracles for distances avoiding a failed node or link. SIAM J. Computing 37, 1299–1318 (2008)
Dor, D., Halperin, S., Zwick, U.: All-pairs almost shortest paths. SIAM J. Computing 29(5), 1740–1759 (2000)
Duan, R., Pettie, S.: Dual-failure distance and connectivity oracles. In: Proc. 20th ACM-SIAM Symp. on Discrete Algorithms (2009)
Eppstein, D., Galil, Z., Italiano, G.F., Nissenzweig, N.: Sparsification – A technique for speeding up dynamic graph algorithms. J. ACM 44 (1997)
Gavoille, C., Peleg, D.: Compact and localized distributed data structures. Distributed Computing 16, 111–120 (2003); PODC Jubilee Special Issue
Holm, J., Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48(4), 723–760 (2001)
Hu, T.C.: Optimum communication spanning trees. SIAM J. Computing 3, 188–195 (1974)
Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. In: Proc. 20th ACM Symp. on Theory of Computing, May 1988, pp. 334–343 (1988)
Khuller, S., Raghavachari, B., Young, N.: Balancing minimum spanning and shortest paths trees. In: Proc. 4th ACM-SIAM Symp. on Discrete Algorithms, Austin, Texas (1993)
Levcopoulos, C., Narasimhan, G., Smid, M.: Efficient algorithms for constructing fault-tolerant geometric spanners. In: Proc. 30th ACM Symp. on Theory of computing, pp. 186–195 (1998)
Lukovszki, T.: New results on fault tolerant geometric spanners. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 193–204. Springer, Heidelberg (1999)
Pǎtraşcu, M., Thorup, M.: Planning for fast connectivity updates. In: Proc. 48th IEEE Symp. on Foundations of Computer Science, pp. 263–271 (2007)
Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia (2000)
Peleg, D., Reshef, E.: Deterministic polylog approximation for minimum communication spanning trees. In: Proc. 25th Int. Colloq. on Automata, Languages & Prog., pp. 670–681 (1998)
Peleg, D., Upfal, E.: A tradeoff between size and efficiency for routing tables. J. ACM 36, 510–530 (1989)
Peleg, D.: Proximity-preserving labeling schemes and their applications. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 30–41. Springer, Heidelberg (1999)
Peleg, D.: Informative labeling schemes for graphs. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 579–588. Springer, Heidelberg (2000)
Peleg, D., Schäffer, A.A.: Graph spanners. J. of Graph Theory 13, 99–116 (1989)
Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. SIAM J. Computing 18(2), 740–747 (1989)
Roditty, L., Thorup, M., Zwick, U.: Deterministic constructions of approximate distance oracles and spanners. In: Proc. 32nd Int. Colloq. on Automata, Languages & Prog., pp. 261–272 (2005)
Thorup, M., Zwick, U.: Compact routing schemes. In: Proc. 14th ACM Symp. on Parallel Algorithms and Architecture, Hersonissos, Crete, pp. 1–10 (2001)
Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM 52, 1–24 (2005)
Thorup, M., Zwick, U.: Spanners and emulators with sublinear distance errors. In: 17th Symp. on Discrete Algorithms (SODA), pp. 802–809. ACM-SIAM, New York (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peleg, D. (2009). As Good as It Gets: Competitive Fault Tolerance in Network Structures. In: Guerraoui, R., Petit, F. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2009. Lecture Notes in Computer Science, vol 5873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05118-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-05118-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05117-3
Online ISBN: 978-3-642-05118-0
eBook Packages: Computer ScienceComputer Science (R0)