skip to main content
10.1145/1400751.1400808acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
demonstration

Dynamic routing and location services in metrics of low doubling dimension

Published: 18 August 2008 Publication History

Abstract

No abstract available.

References

[1]
I. Abraham, D. Dolev, and D. Malkhi. LLS: a locality aware location service for mobile ad hoc networks. In Proc. 2004 DIALM-POMC, 2004.
[2]
I. Abraham, C. Gavoille, A. V. Goldberg, and D. Malkhi. Routing in networks with low doubling dimension. In Proc. 26th ICDCS, page 75, 2006.
[3]
H. T.-H. Chan, A. Gupta, B. M. Maggs, and S. Zhou. On hierarchical routing in doubling metrics. In Proc. 16th SODA, pages 762--771, 2005.
[4]
R. Flury and R. Wattenhofer. MLS: an efficient location service for mobile ad hoc networks. In Proc. 7th MobiHoc, pages 226--237, 2006.
[5]
G. Konjevod, A. W. Richa, and D. Xia. Optimal-stretch name-independent compact routing in doubling metrics. In Proc. 25th PODC, pages 198--207, 2006.
[6]
G. Konjevod, A. W. Richa, and D. Xia. Optimal scale-free compact routing schemes in networks of low doubling dimension. In Proc. 18th SODA, pages 939--948, 2007.
[7]
G. Konjevod, A. W. Richa, D. Xia, and H. Yu. Compact routing with slack in low doubling dimension. In Proc. 26th PODC, pages 71--80, 2007.
[8]
A. Slivkins. Distance estimation and object location via rings of neighbors. In Proc. 24th PODC, 2005.
[9]
A. Slivkins. Towards fast decentralized construction of locality-aware overlay networks. In Proc. 26th PODC, pages 89--98, 2007.
[10]
K. Talwar. Bypassing the embedding: algorithms for low dimensional metrics. In Proc. 36th STOC, pages 281--290, 2004.

Cited By

View all
  • (2023)One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00012(60-76)Online publication date: 6-Nov-2023
  • (2020)A General Coreset-Based Approach to Diversity Maximization under Matroid ConstraintsACM Transactions on Knowledge Discovery from Data10.1145/340244814:5(1-27)Online publication date: 5-Aug-2020
  • (2020)MiSoSouPACM Transactions on Knowledge Discovery from Data10.1145/338565314:5(1-31)Online publication date: 21-Jun-2020
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
August 2008
474 pages
ISBN:9781595939890
DOI:10.1145/1400751
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: 18 August 2008

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. doubling dimension
  2. dynamic routing
  3. location services

Qualifiers

  • Demonstration

Conference

PODC '08

Acceptance Rates

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

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 14 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2023)One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00012(60-76)Online publication date: 6-Nov-2023
  • (2020)A General Coreset-Based Approach to Diversity Maximization under Matroid ConstraintsACM Transactions on Knowledge Discovery from Data10.1145/340244814:5(1-27)Online publication date: 5-Aug-2020
  • (2020)MiSoSouPACM Transactions on Knowledge Discovery from Data10.1145/338565314:5(1-31)Online publication date: 21-Jun-2020
  • (2020)Learning Distance Metrics from Probabilistic InformationACM Transactions on Knowledge Discovery from Data10.1145/336432014:5(1-33)Online publication date: 6-Jul-2020
  • (2020)Dimensionality-adaptive k-center in sliding windows2020 IEEE 7th International Conference on Data Science and Advanced Analytics (DSAA)10.1109/DSAA49011.2020.00032(197-206)Online publication date: Oct-2020
  • (2016)Forbidden-Set Distance Labels for Graphs of Bounded Doubling DimensionACM Transactions on Algorithms10.1145/281869412:2(1-17)Online publication date: 12-Feb-2016
  • (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
  • (2008)Dynamic Routing and Location Services in Metrics of Low Doubling DimensionDistributed Computing10.1007/978-3-540-87779-0_26(379-393)Online publication date: 2008

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media