article

Fault-tolerant compact routing schemes for general graphs

Author:

Shiri ChechikAuthors Info & Claims

Information and Computation, Volume 222

Pages 36 - 44

https://doi.org/10.1016/j.ic.2012.10.009

Published: 01 January 2013 Publication History

Abstract

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.

References

[1]

I. Abraham, S. Chechik, C. Gavoille, D. Peleg, Forbidden-set distance labels for graphs of bounded doubling dimension, in: Proc. 29th ACM Symp. on Principles of Distributed Computing (PODC), 2010, pp. 192-200.

[2]

S. Alstrup, G.S. Brodal, T. Rauhe, New data structures for orthogonal range searching, in: Proc. 41st IEEE Symp. on Foundations of Computer Science (FOCS), 2000, pp. 198-207.

[3]

Awerbuch, B., Bar-Noy, A., Linial, N. and Peleg, D., Improved routing strategies with succinct tables. J. Algorithms. v11 i3. 307-341.

[4]

B. Awerbuch, S. Kutten, D. Peleg, On buffer-economical store-and-forward deadlock prevention, in: Proc. 10th IEEE International Conference on Computer Communications (INFOCOM), 1991, pp. 410-414.

[5]

B. Awerbuch, D. Peleg, Sparse partitions, in: Proc. 31st IEEE Symp. on Foundations of Computer Science (FOCS), 1990, pp. 503-513.

[6]

S. Chechik, M. Langberg, D. Peleg, L. Roditty, f-Sensitivity distance oracles and routing schemes, in: Proc. 8th European Symposium on Algorithms (ESA), 2010, pp. 84-96.

[7]

E. Cohen, Fast algorithms for constructing t-spanners and paths with stretch t, in: Proc. 34th IEEE Symp. on Foundations of Computer Science (FOCS), 1993, pp. 648-658.

Digital Library

[8]

B. Courcelle, A. Twigg, Compact forbidden-set routing, in: Proc. 27th international Symposium on Theoretical Aspects of Computer Science (STACS), 2007, pp. 37-48.

[9]

Cowen, L.J., Compact routing with minimum stretch. J. Algorithms. v38. 170-183.

[10]

de Berg, M., Cheong, O., van Kreveld, M. and Overmars, M., Computational Geometry: Algorithms and Applications. 2008. Springer.

[11]

R. Duan, S. Pettie, Connectivity oracles for failure prone graphs, in: Proc. 42nd ACM Symp. on Theory of Computing (STOC), 2010, pp. 465-474.

[12]

Eilam, T., Gavoille, C. and Peleg, D., Compact routing schemes with low stretch factor. J. Algorithms. v46. 97-114.

[13]

P. Fraigniaud, C. Gavoille, Memory requirement for universal routing schemes, in: Proc. 14th ACM Symp. on Principles of Distributed Computing (PODC), 1995, pp. 223-230.

[14]

Gavoille, C. and Gengler, M., Space-efficiency for routing schemes of stretch factor three. J. Parallel Distrib. Comput. v61. 679-687.

Digital Library

[15]

Gavoille, C. and Peleg, D., Compact and localized distributed data structures. Distrib. Comput. v16. 111-120.

Digital Library

[16]

Peleg, D., Distributed Computing: A Locality-Sensitive Approach. 2000. SIAM.

[17]

Peleg, D. and Upfal, E., A trade-off between space and efficiency for routing tables. J. ACM. v36 i3. 510-530.

[18]

Santoro, N. and Khatib, R., Labelling and implicit routing in networks. Comput. J. v28 i1. 5-8.

[19]

M. Thorup, U. Zwick, Compact routing schemes, in: Proc. 13th ACM Symp. on Parallel Algorithms and Architectures (SPAA), 2001, pp. 1-10.

Digital Library

[20]

Thorup, M. and Zwick, U., Approximate distance oracles. J. ACM. v52. 1-24.

[21]

D.A. Twigg, Compact forbidden-set routing, PhD thesis, University of Cambridge, King's College, 2006.

[22]

van Leeuwen, J. and Tan, R., Computer networks with compact routing tables. In: Rozemberg, G., Salomaa, A. (Eds.), The Book of L, Springer-Verlag. pp. 259-273.

Cited By

Baswana SChoudhary KHussain MRoditty L(2020)Approximate Single-Source Fault Tolerant Shortest PathACM Transactions on Algorithms10.1145/339753216:4(1-22)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3397532
Castañeda ALefévre JTrehan A(2020)Fully Compact Routing in Low Memory Self-Healing TreesProceedings of the 21st International Conference on Distributed Computing and Networking10.1145/3369740.3369786(1-10)Online publication date: 4-Jan-2020
https://dl.acm.org/doi/10.1145/3369740.3369786
Baswana SChoudhary KRoditty L(2019)An Efficient Strongly Connected Components Algorithm in the Fault Tolerant ModelAlgorithmica10.1007/s00453-018-0452-381:3(967-985)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.1007/s00453-018-0452-3
Show More Cited By

Fault-tolerant compact routing schemes for general graphs
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis

Recommendations

Fault-tolerant compact routing schemes for general graphs
ICALP'11: Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II

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 ...
Compact Routing on Random Power Law Graphs
DASC '09: Proceedings of the 2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing

Routing table size and route length are two key metrics for evaluating a routing scheme, and there is an obvious tradeoff between them, i.e. the space-stretch tradeoff. The generic shortest-path routing takes an extreme position by only optimizing the ...
Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension

We consider compact routing schemes in networks of low doubling dimension, where the doubling dimension is the least value α such that any ball in the network can be covered by at most 2^α balls of half radius. There are two variants of routing-scheme ...

Comments

Information & Contributors

Information

Published In

cover image Information and Computation

Information and Computation Volume 222, Issue

January, 2013

308 pages

ISSN:0890-5401

Issue’s Table of Contents

Copyright © Elsevier Inc. © 2012.

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 January 2013

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Baswana SChoudhary KHussain MRoditty L(2020)Approximate Single-Source Fault Tolerant Shortest PathACM Transactions on Algorithms10.1145/339753216:4(1-22)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3397532
Castañeda ALefévre JTrehan A(2020)Fully Compact Routing in Low Memory Self-Healing TreesProceedings of the 21st International Conference on Distributed Computing and Networking10.1145/3369740.3369786(1-10)Online publication date: 4-Jan-2020
https://dl.acm.org/doi/10.1145/3369740.3369786
Baswana SChoudhary KRoditty L(2019)An Efficient Strongly Connected Components Algorithm in the Fault Tolerant ModelAlgorithmica10.1007/s00453-018-0452-381:3(967-985)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.1007/s00453-018-0452-3
Baswana SChoudhary KHussain MRoditty LCzumaj A(2018)Approximate single source fault tolerant shortest pathProceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3174304.3175429(1901-1915)Online publication date: 7-Jan-2018
https://dl.acm.org/doi/10.5555/3174304.3175429
Baswana SChoudhary KRoditty LWichs DMansour Y(2016)Fault tolerant subgraph for single source reachability: generic and optimalProceedings of the forty-eighth annual ACM symposium on Theory of Computing10.1145/2897518.2897648(509-518)Online publication date: 19-Jun-2016
https://dl.acm.org/doi/10.1145/2897518.2897648
Castañeda ADolev DTrehan A(2016)Compact routing messages in self-healing treesProceedings of the 17th International Conference on Distributed Computing and Networking10.1145/2833312.2833328(1-10)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.1145/2833312.2833328
Baswana SChoudhary KRoditty L(2015)Fault Tolerant Reachability for Directed GraphsProceedings of the 29th International Symposium on Distributed Computing - Volume 936310.1007/978-3-662-48653-5_35(528-543)Online publication date: 7-Oct-2015
https://dl.acm.org/doi/10.1007/978-3-662-48653-5_35

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents