More Web Proxy on the site http://driver.im/

Article

Compact routing with slack in low doubling dimension

Authors:

Goran Konjevod,

Andrea Werneck Richa,

Hai YuAuthors Info & Claims

PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing

Pages 71 - 80

https://doi.org/10.1145/1281100.1281113

Published: 12 August 2007 Publication History

Abstract

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, we relax our guarantees to allow for (i) a small fraction of nodes to have large storage, say size of O(n log n) bits, or (ii) a small fraction of source-destination pairs to have larger, but still constant, stretch.

In this paper, given any constant ε ∈ (0,1), any δ ∈ Θ(1/ polylog n) and any connected edge-weighted undirected graph G with doubling dimension α ∈ O(log log n) and arbitrary node names, we present

1. a (1+ε)-stretch name-independent routing scheme for G with polylogarithmic packet header size, and with (1-δ)n nodes storing polylogarithmic size routing tables each and the remaining δn nodes storing O(nlog n)-bit routing tables each.

2. a name-independent routing scheme for G with polylogarithmic storage and packet header size, and with stretch (1+ε) for (1-α n source nodes and (9+ε) for the remaining α n source nodes.

.

These results are to be contrasted with our lower bound from PODC 2006, where we showed that stretch 9 is asymptotically optimal for name-independent compact routing schemes in networks of constant doubling dimension.

References

[1]

I. Abraham, Y. Bartal, J. Kleinberg, T.-H. Chan, O. Neiman, K. Dhamdhere, A. Slivkins, and A. Gupta. Metric embeddings with relaxed guarantees. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science, pages 83--100, 2005.

Digital Library

[2]

I. Abraham, Y. Bartal, and O. Neiman. Advances in metric embedding theory. In Proceedings of the 38th ACM Symposium on Theory of Computing, pages 271--286, 2006.

Digital Library

[3]

I. Abraham, Y. Bartal, and O. Neiman. Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. In Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms, pages 502--511, 2007.

Digital Library

[4]

I. Abraham, C. Gavoille, A. V. Goldberg, and D. Malkhi. Routing in networks with low doubling dimension. In Proceedings of the 26th IEEE International Conference on Distributed Computing Systems, page 75, 2006.

Digital Library

[5]

I. Abraham, C. Gavoille, and D. Malkhi. On space-stretch trade-offs: Lower bounds. In Proceedings of the 18th ACM Symposium on Parallel Algorithms and Architecture, pages 207--216, 2006.

Digital Library

[6]

H. T. H. Chan, M. Dinitz, and A. Gupta. Spanners with slack. In Proceedings of the 14th European Symposium on Algorithms, volume 4168 of Lecture Notes in Computer Science, pages 196--207, 2006.

Digital Library

[7]

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

Digital Library

[8]

M. Dinitz. Compact routing with slack. In Proceedings of the 26th ACM Symposium on Principles of Distributed Computing, 2007.

Digital Library

[9]

C. Gavoille. Routing in distributed networks: Overview and open problems. ACM SIGACT News Distributed Computing Column, 32(1):36--52, 2001.

Digital Library

[10]

C. Gavoille and D. Peleg. Compact and localized distributed data structures. Journal of Distributed Computing, 16:111--120, 2003.

Digital Library

[11]

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

Digital Library

[12]

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

Digital Library

[13]

G. Konjevod, A. Richa, and D. Xia. Optimal-stretch name-independent compact routing in doubling metrics. In Proceedings of the 25th ACM Symposium on Principles of Distributed Computing, pages 198--207, 2006.

Digital Library

[14]

G. Konjevod, A. Richa, and D. Xia. Optimal scale-free compact routing schemes in networks of low doubling dimension. In Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms, pages 939--948, 2007.

Digital Library

[15]

D. Peleg. Distributed Computing: A Locality-Sensitive Approach. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, 2000.

Digital Library

[16]

D. Peleg and E. Upfal. A trade-off between space and efficiency for routing tables. Jour. of the ACM, 36(3):510--530, July 1989.

Digital Library

[17]

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

Digital Library

[18]

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

Digital Library

[19]

M. Thorup and U. Zwick. Compact routing schemes. In Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architecture, pages 1--10, 2001.

Digital Library

Cited By

Li QWu YDuan JYang JJiang Y(2022)Weighted NSFIB Aggregation With Generalized Next Hop of Strict Partial OrderIEEE Transactions on Network and Service Management10.1109/TNSM.2022.315038919:2(890-904)Online publication date: Jun-2022
https://doi.org/10.1109/TNSM.2022.3150389
Bodwin G(2022)A note on distance-preserving graph sparsificationInformation Processing Letters10.1016/j.ipl.2021.106205174(106205)Online publication date: Mar-2022
https://doi.org/10.1016/j.ipl.2021.106205
Feuilloley LFraigniaud P(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
https://dl.acm.org/doi/10.1145/3470640
Show More Cited By

Recommendations

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 ...
Optimal-stretch name-independent compact routing in doubling metrics
PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing

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 ...
Compact routing design in networks of low doubling dimension

Comments

Please enable JavaScript to view thecomments powered by Disqus.

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

General Chair:
Indranil Gupta
UIUC, USA
,
Program Chair:
Rogert Wattenhofer
ETH Zurich, Switzerland

Copyright © 2007 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: 12 August 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

PODC07

Sponsor:

PODC07: ACM Symposium on Principles of Distributed Computing 2007

August 12 - 15, 2007

Oregon, Portland, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
198
Total Downloads

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

Reflects downloads up to 11 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Li QWu YDuan JYang JJiang Y(2022)Weighted NSFIB Aggregation With Generalized Next Hop of Strict Partial OrderIEEE Transactions on Network and Service Management10.1109/TNSM.2022.315038919:2(890-904)Online publication date: Jun-2022
https://doi.org/10.1109/TNSM.2022.3150389
Bodwin G(2022)A note on distance-preserving graph sparsificationInformation Processing Letters10.1016/j.ipl.2021.106205174(106205)Online publication date: Mar-2022
https://doi.org/10.1016/j.ipl.2021.106205
Feuilloley LFraigniaud P(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
https://dl.acm.org/doi/10.1145/3470640
Feuilloley LFraigniaud PBlelloch GAgrawal K(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
https://dl.acm.org/doi/10.1145/2755573.2755596
Bartal YGottlieb LNeiman OCheng SDevillers O(2014)On the Impossibility of Dimension Reduction for Doubling Subsets of ℓpProceedings of the thirtieth annual symposium on Computational geometry10.1145/2582112.2582170(60-66)Online publication date: 8-Jun-2014
https://dl.acm.org/doi/10.1145/2582112.2582170
Abraham IBartal YNeiman OSchulman L(2014)Volume in General Metric SpacesDiscrete & Computational Geometry10.1007/s00454-014-9615-452:2(366-389)Online publication date: 1-Sep-2014
https://dl.acm.org/doi/10.1007/s00454-014-9615-4
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
Srinivasagopalan SBusch CIyengar S(2012)An Oblivious Spanning Tree for Single-Sink Buy-at-Bulk in Low Doubling-Dimension GraphsIEEE Transactions on Computers10.1109/TC.2011.6461:5(700-712)Online publication date: 1-May-2012
https://dl.acm.org/doi/10.1109/TC.2011.64
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
Gottlieb LKrauthgamer R(2010)Proximity algorithms for nearly-doubling spacesProceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques10.5555/1886521.1886537(192-204)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.5555/1886521.1886537
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