Article

Optimal-stretch name-independent compact routing in doubling metrics

Authors:

Goran Konjevod,

Andréa W. Richa,

Donglin XiaAuthors Info & Claims

PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing

Pages 198 - 207

https://doi.org/10.1145/1146381.1146412

Published: 23 July 2006 Publication History

Abstract

We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension of a metric space is the least value α such that any ball of radius r can be covered by at most 2^α balls of radius r/2.Given any δ>0 and a weighted undirected network G whose shortest path metric d is a doubling metric with doubling dimension α, we present a name-independent routing scheme for G with (9+δ)-stretch, (2+1<over>δ)^O(α) (log δ)² (log n)-bit routing information at each node, and packet headers of size O(log n), where δ is the ratio of the largest to the smallest shortest path distance in G.In addition, we prove that for any ε ∈ (0,8), there is a doubling metric network G with n nodes, doubling dimension α ≤ 6 - log ε, and Δ=O(2^1/εn) such that any name-independent routing scheme on G with routing information at each node of size o(n^(ε/60)²)-bits has stretch larger than 9-ε. Therefore assuming that Δ is bounded by a polynomial on n, our algorithm basically achieves optimal stretch for name-independent routing in doubling metrics with packet header size and routing information at each node both bounded by a polylogarithmic function of n.

References

[1]

I. Abraham and C. Gavoille. Object location using path separators. Technical Report RR-1394-06, LaBRI, University of Bordeaux, March 2006.

Digital Library

[2]

I. Abraham, C. Gavoille, A. V. Goldberg, and D. Malkhi. Routing in networks with low doubling dimension. In 26th International Conference on Distributed Computing Systems (ICDCS). IEEE Computer Society Press, July 2006. To appear.

Digital Library

[3]

I. Abraham, C. Gavoille, and D. Malkhi. Routing with improved communication-space trade-off. In Proceedings of the 18th International Conference on Distributed Computing, volume 3274 of Lecture Notes in Computer Science, pages 305--319, 2004.

[4]

I. Abraham, C. Gavoille, and D. Malkhi. Compact routing for graphs excluding a fixed minor. In Proceedings of the 19th International Conference on Distributed Computing, volume 3724 of Lecture Notes in Computer Science, pages 442--456, 2005.

Digital Library

[5]

I. Abraham and D. Malkhi. Compact routing on Euclidean metrics. In Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, pages 141--149, 2004.

Digital Library

[6]

I. Abraham and D. Malkhi. Name independent routing for growth bounded networks. In Proceedings of the 17th Annual ACM Symposium on Parallel Algorithms and Architecture, pages 49--55, 2005.

Digital Library

[7]

I. Abraham, D. Malkhi, and O. Dobzinski. Land: stretch (1+ε) locality-aware networks for DHTs. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 550--559, 2004.

Digital Library

[8]

B. Awerbuch and D. Peleg. Routing with polynomial communication-space trade-off. SIAM J. Discret. Math., 5(2):151--162, 1992.

Digital Library

[9]

H. T.-H. Chan, A. Gupta, B. Maggs, and S. Zhou. On hierarchical routing in doubling metrics. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 762--771, 2005.

Digital Library

[10]

A. Gupta, R. Krauthgamer, and J.R.Lee. Bounded geometries, fractals and low-distortion embeddings. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 534--543, 2003.

Digital Library

[11]

S. Har-Peled and M. Mendel. Fast construction of nets in low dimensional metrics and their applications. In Proceedings of the 21st Annual ACM Symposium on Computational Geometry, pages 150--158, 2005.

Digital Library

[12]

Y. Hassin and D. Peleg. Sparse communication networks and efficient routing in the plane. Distributed computing, 14:205--215, 2001.

Digital Library

[13]

D. Karger and M. Ruhl. Finding nearest neighbors in growth-restricted metrics. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 63--66, 2002.

Digital Library

[14]

J. Kleinberg, A. Slivkins, and T. Wexler. Triangulation and embedding using small sets of beacons. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pages 444--453, 2004.

Digital Library

[15]

R. Krauthgamer and J. R. Lee. Navigating nets: simple algorithms for proximity search. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 798--807, 2004.

Digital Library

[16]

T. S. E. Ng and H. Zhang. Predicting Internet network distance with coordinates-based approaches. In Proceedings of the 21th Annual Joint Conference of the IEEE Computer and Communications Society, pages 170--179, 2002.

[17]

R.Krauthgamer, J. R. Lee, M. Mendel, and A. Naor. Measured descent: A new embedding method for finite metrics. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pages 434--443, 2004.

Digital Library

[18]

A. Slivkins. Distance estimation and object location via rings of neighbors. In Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing, pages 41--50, 2005.

Digital Library

[19]

A. Slivkins. Distributed approaches to triangulation and embedding. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 640--649, 2005.

Digital Library

[20]

K. Talwar. Bypassing the embedding: algorithms for low dimensional metrics. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 281--290, 2004.

Digital Library

[21]

M. Thorup. Compact oracles for reachability and approximate distances in planar digraphs. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 242--251, 2001.

Digital Library

Cited By

Konjevod GRicha AXia D(2016)Scale-Free Compact Routing Schemes in Networks of Low Doubling DimensionACM Transactions on Algorithms10.1145/287605512:3(1-29)Online publication date: 15-Jun-2016
https://dl.acm.org/doi/10.1145/2876055
Kosowski ALi BNisse NSuchan K(2015)k-Chordal GraphsAlgorithmica10.1007/s00453-014-9871-y72:3(758-777)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.1007/s00453-014-9871-y
Tschopp DDiggavi SGrossglauser M(2015)Hierarchical routing over dynamic wireless networksRandom Structures & Algorithms10.1002/rsa.2058947:4(669-709)Online publication date: 1-Dec-2015
https://dl.acm.org/doi/10.1002/rsa.20589
Show More Cited By

Recommendations

On Hierarchical Routing in Doubling Metrics

We study the problem of routing in doubling metrics and show how to perform hierarchical routing in such metrics with small stretch and compact routing tables (i.e., with a small amount of routing information stored at each vertex). We say that a metric (...
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 ...
Compact routing with slack in low doubling dimension
PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
We consider the problem of compact routing with slack in networks of low doubling dimension. Namely, we seek name-independent routing schemes with (1+ε) stretch and polylogarithmic storage at each node: since existing lower bound precludes such a scheme,...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing

July 2006

230 pages

ISBN:1595933840

DOI:10.1145/1146381

General Chair:
Eric Ruppert
York U., Canada
,
Program Chair:
Dahlia Malkhi
Microsoft Research, USA & Hebrew University, Israel

Copyright © 2006 ACM.

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: 23 July 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

PODC06

Sponsor:

PODC06: ACM Symposium on Principles of Distributed Computing 2006

July 23 - 26, 2006

Colorado, Denver, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

31
Total Citations
View Citations
243
Total Downloads

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

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Konjevod GRicha AXia D(2016)Scale-Free Compact Routing Schemes in Networks of Low Doubling DimensionACM Transactions on Algorithms10.1145/287605512:3(1-29)Online publication date: 15-Jun-2016
https://dl.acm.org/doi/10.1145/2876055
Kosowski ALi BNisse NSuchan K(2015)k-Chordal GraphsAlgorithmica10.1007/s00453-014-9871-y72:3(758-777)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.1007/s00453-014-9871-y
Tschopp DDiggavi SGrossglauser M(2015)Hierarchical routing over dynamic wireless networksRandom Structures & Algorithms10.1002/rsa.2058947:4(669-709)Online publication date: 1-Dec-2015
https://dl.acm.org/doi/10.1002/rsa.20589
Sarkar RZhu XGao J(2013)Distributed and compact routing using spatial distributions in wireless sensor networksACM Transactions on Sensor Networks10.1145/2480730.24807359:3(1-20)Online publication date: 4-Jun-2013
https://dl.acm.org/doi/10.1145/2480730.2480735
Gavoille CGlacet CHanusse NIlcinkas D(2013)On the Communication Complexity of Distributed Name-Independent Routing SchemesDistributed Computing10.1007/978-3-642-41527-2_29(418-432)Online publication date: 2013
https://doi.org/10.1007/978-3-642-41527-2_29
Chen WSommer CTeng SWang Y(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
https://dl.acm.org/doi/10.1145/2390176.2390180
Huc FJarry ALeone PRolim J(2012)On the efficiency of routing in sensor networksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2012.02.02172:7(889-901)Online publication date: 1-Jul-2012
https://dl.acm.org/doi/10.1016/j.jpdc.2012.02.021
Chepoi VDragan FEstellon BHabib MVaxès YXiang Y(2012)Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic GraphsAlgorithmica10.1007/s00453-010-9478-x62:3-4(713-732)Online publication date: 1-Apr-2012
https://dl.acm.org/doi/10.1007/s00453-010-9478-x
Gao JZhou D(2011)Resilient and low stretch routing through embedding into tree metricsProceedings of the 12th international conference on Algorithms and data structures10.5555/2033190.2033227(438-450)Online publication date: 15-Aug-2011
https://dl.acm.org/doi/10.5555/2033190.2033227
Konjevod GRicha AXia DZhou LGavoille CFraigniaud P(2011)Randomized compact routing in decomposable metricsProceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing10.1145/1993806.1993879(351-352)Online publication date: 6-Jun-2011
https://dl.acm.org/doi/10.1145/1993806.1993879
Show More Cited By

View Options

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents