skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension

Journal Article · · ACM Transactions on Algorithms
DOI:https://doi.org/10.1145/2876055· OSTI ID:1390021
 [1];  [2];  [3]
  1. Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
  2. Arizona State Univ., Tempe, AZ (United States)
  3. Google, Kirkland, WA (United States)
+ Show Author Affiliations

In this work, 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 design: (i) labeled (name-dependent) routing, in which the designer is allowed to rename the nodes so that the names (labels) can contain additional routing information, for example, topological information; and (ii) name-independent routing, which works on top of the arbitrary original node names in the network, that is, the node names are independent of the routing scheme. In this article, given any constant ε ϵ (0, 1) and an n-node edge-weighted network of doubling dimension α ϵ O(loglog n), we present —a (1 + ε)-stretch labeled compact routing scheme with Γlog n-bit routing labels, O(log2 n/loglog n)-bit packet headers, and ((1/ε)O(α) log3 n)-bit routing information at each node; —a (9 + ε)-stretch name-independent compact routing scheme with O(log2 n/loglog n)-bit packet headers, and ((1/ε)O(α) log3 n)-bit routing information at each node. In addition, we prove a lower bound: any name-independent routing scheme with o(n(ε/60)2) bits of storage at each node has stretch no less than 9 - ε for any ε ϵ (0, 8). Therefore, our name-independent routing scheme achieves asymptotically optimal stretch with polylogarithmic storage at each node and packet headers. Note that both schemes are scale-free in the sense that their space requirements do not depend on the normalized diameter Δ of the network. Finally, we also present a simpler nonscale-free (9 + ε)-stretch name-independent compact routing scheme with improved space requirements if Δ is polynomial in n.

Research Organization:
Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)
Sponsoring Organization:
USDOE
Grant/Contract Number:
AC52-07NA27344
OSTI ID:
1390021
Report Number(s):
LLNL-JRNL-738008
Journal Information:
ACM Transactions on Algorithms, Vol. 12, Issue 3; ISSN 1549-6325
Publisher:
Association for Computing MachineryCopyright Statement
Country of Publication:
United States
Language:
English
Citation Metrics:
Cited by: 2 works
Citation information provided by
Web of Science

References (27)

Routing in Networks with Low Doubling Dimension conference January 2006
Chord: A scalable peer-to-peer lookup service for internet applications
  • Stoica, Ion; Morris, Robert; Karger, David
  • Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '01 https://doi.org/10.1145/383059.383071
conference January 2001
Triangulation and embedding using small sets of beacons journal September 2009
Distance estimation and object location via rings of neighbors conference January 2005
Compact routing schemes with low stretch factor (extended abstract)
  • Eilam, Tamar; Gavoille, Cyril; Peleg, David
  • Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 https://doi.org/10.1145/277697.277702
conference January 1998
Bypassing the embedding: algorithms for low dimensional metrics conference January 2004
Sparse partitions conference January 1990
Name independent routing for growth bounded networks conference January 2005
Object location using path separators conference January 2006
Optimal-stretch name-independent compact routing in doubling metrics conference January 2006
Routing in distributed networks: overview and open problems journal March 2001
Routing in Trees book January 2001
Spanners with Slack book January 2006
Compact Routing with Minimum Stretch journal January 2001
Compact and localized distributed data structures journal September 2003
Compact routing schemes conference January 2001
Finding nearest neighbors in growth-restricted metrics conference January 2002
On space-stretch trade-offs: lower bounds
  • Abraham, Ittai; Gavoille, Cyril; Malkhi, Dahlia
  • Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '06 https://doi.org/10.1145/1148109.1148143
conference January 2006
On space-stretch trade-offs: upper bounds
  • Abraham, Ittai; Gavoille, Cyril; Malkhi, Dahlia
  • Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '06 https://doi.org/10.1145/1148109.1148144
conference January 2006
Searching dynamic point sets in spaces with bounded doubling dimension conference January 2006
Fast construction of nets in low dimensional metrics, and their applications conference January 2005
Compact oracles for reachability and approximate distances in planar digraphs journal November 2004
Routing with Polynomial Communication-Space Srade-ff journal May 1992
Routing with Improved Communication-Space Trade-Off book January 2004
Measured Descent: A New Embedding Method for Finite Metrics conference January 2004
Distributed Computing: A Locality-Sensitive Approach journal January 2000
Bounded geometries, fractals, and low-distortion embeddings
  • Gupta, A.; Krauthgamer, R.; Lee, J. R.
  • 44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. https://doi.org/10.1109/SFCS.2003.1238226
conference January 2003

Cited By (2)

Space-Stretch Tradeoff in Routing Revisited text January 2022
Labeling Algorithm and Compact Routing Scheme for a Small World Network Model preprint January 2018

Similar Records

Related Subjects

97 MATHEMATICS AND COMPUTING
Scale free
labeled routing
name-independent routing
compact routing
doubling dimension