skip to main content
10.1145/1281100.1281114acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
Article

Compact routing with slack

Published: 12 August 2007 Publication History

Abstract

Given a weighted graph G=(V,E), a compact routing scheme is a distributed algorithm for forwarding packets from any source to any destination. The fundamental tradeoff is between the space used at each node and the stretch of the total route, measured by the multiplicative factor between the actual distance traveled and the length of the shortest possible route. We extend the normal definition with a slack parameter ε, which allows us to ignore up to εn2 of the shortest pairwise routes and give a guarantee on the remaining ones. For constant ε we give constant stretch, polylogarithmic space schemes in the name-dependent model and in the designer-port name-independent model, and give a lower bound that proves that such schemes do not exist in the fixed-port name-independent model. In the name-dependent model we also give a gracefully degrading scheme which works simultaneously for all ε > 0 and guarantees constant average stretch with polylog space.

References

[1]
I. Abraham, Y. Bartal, H. T.-H. Chan, K. Dhamdhere, A. Gupta, J. M. Kleinberg, O. Neiman, and A. Slivkins. Metric embeddings with relaxed guarantees. In Proceedings of the 46th Symposium on the Foundations of Computer Science (FOCS), pages 83--100, 2005.
[2]
I. Abraham, Y. Bartal, and O. Neiman. Advances in metric embedding theory. In 38th STOC, 2006.
[3]
I. Abraham, C. Gavoille, and D. Malkhi. Routing with improved communication-space trade-off. In R. Guerraoui, editor, DISC, volume 3274 of Lecture Notes in Computer Science, pages 305--319. Springer, 2004.
[4]
I. Abraham, C. Gavoille, and D. Malkhi. On space-stretch trade-offs: lower bounds. In SPAA '06: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, pages 207--216, New York, NY, USA, 2006. ACM Press.
[5]
I. Abraham, C. Gavoille, and D. Malkhi. On space-stretch trade-offs: upper bounds. In SPAA '06: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, pages 217--224, New York, NY, USA, 2006. ACM Press.
[6]
H. T.-H. Chan, M. Dinitz, and A. Gupta. Spanners with slack. In ESA, pages 196--207, 2006.
[7]
D. Coppersmith and M. Elkin. Sparse source-wise and pair-wise distance preservers. In Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 660--669, 2005.
[8]
P. Fraigniaud and C. Gavoille. Routing in trees. In ICALP '01: Proceedings of the 28th International Colloquium on Automata, Languages, and Programming, pages 757--772, London, UK, 2001. Springer-Verlag.
[9]
P. Fraigniaud and C. Gavoille. A space lower bound for routing in trees. In STACS '02: Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, pages 65--75, London, UK, 2002. Springer-Verlag.
[10]
J. M. Kleinberg, A. Slivkins, and T. Wexler. Triangulation and embedding using small sets of beacons. In 45th FOCS, 2004.
[11]
K. A. Laing. Brief announcement: name-independent compact routing in trees. In PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pages 382--382, New York, NY, USA, 2004. ACM Press.
[12]
J. Matoušek. On embedding expanders into lp spaces. Israel J. Math., 102:189--197, 1997.
[13]
M. Thorup and U. Zwick. Compact routing schemes. In SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, pages 1--10, New York, NY, USA, 2001. ACM Press.
[14]
M. Thorup and U. Zwick. Approximate distance oracles. J. ACM, 52(1):1--24 (electronic), 2005.

Cited By

View all
  • (2022)A note on distance-preserving graph sparsificationInformation Processing Letters10.1016/j.ipl.2021.106205174(106205)Online publication date: Mar-2022
  • (2021)Randomized Local Network Computing: Derandomization Beyond Locally Checkable LabelingsACM Transactions on Parallel Computing10.1145/34706408:4(1-25)Online publication date: 15-Oct-2021
  • (2015)Randomized Local Network ComputingProceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures10.1145/2755573.2755596(340-349)Online publication date: 13-Jun-2015
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
August 2007
424 pages
ISBN:9781595936165
DOI:10.1145/1281100
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 August 2007

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. compact routing
  2. slack

Qualifiers

  • Article

Conference

PODC07

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)5
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2022)A note on distance-preserving graph sparsificationInformation Processing Letters10.1016/j.ipl.2021.106205174(106205)Online publication date: Mar-2022
  • (2021)Randomized Local Network Computing: Derandomization Beyond Locally Checkable LabelingsACM Transactions on Parallel Computing10.1145/34706408:4(1-25)Online publication date: 15-Oct-2021
  • (2015)Randomized Local Network ComputingProceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures10.1145/2755573.2755596(340-349)Online publication date: 13-Jun-2015
  • (2014)Volume in General Metric SpacesDiscrete & Computational Geometry10.1007/s00454-014-9615-452:2(366-389)Online publication date: 1-Sep-2014
  • (2012)A compact routing scheme and approximate distance oracle for power-law graphsACM Transactions on Algorithms10.1145/2390176.23901809:1(1-26)Online publication date: 26-Dec-2012
  • (2012)Everywhere-Sparse Spanners via Dense SubgraphsProceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science10.1109/FOCS.2012.61(758-767)Online publication date: 20-Oct-2012
  • (2010)Volume in general metric spacesProceedings of the 18th annual European conference on Algorithms: Part II10.5555/1882123.1882134(87-99)Online publication date: 6-Sep-2010
  • (2010)Volume in General Metric SpacesAlgorithms – ESA 201010.1007/978-3-642-15781-3_8(87-99)Online publication date: 2010
  • (2009)Labels, routing, and capacityProceedings of the 28th IEEE international conference on Computer Communications Workshops10.5555/1719850.1719934(365-366)Online publication date: 19-Apr-2009
  • (2009)Labels, Routing, and Capacity: Bringing Theoretical Networking Closer to PracticeIEEE INFOCOM Workshops 200910.1109/INFCOMW.2009.5072158(1-2)Online publication date: Apr-2009
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media