ScaleFree Compact Routing Schemes in Networks of Low Doubling Dimension
Abstract
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 routingscheme design: (i) labeled (namedependent) 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) nameindependent 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 nnode edgeweighted network of doubling dimension α ϵ O(loglog n), we present —a (1 + ε)stretch labeled compact routing scheme with Γlog nbit routing labels, O(log^{2} n/loglog n)bit packet headers, and ((1/ε)^{O(α)} log^{3} n)bit routing information at each node; —a (9 + ε)stretch nameindependent compact routing scheme with O(log^{2} n/loglog n)bit packet headers, and ((1/ε)^{O(α)} log^{3} n)bit routing information at each node. In addition, we prove a lower bound: any nameindependent routing scheme with o(n^{(ε/60)2}) bits of storage at each node has stretch nomore »
 Authors:

 Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
 Arizona State Univ., Tempe, AZ (United States)
 Google, Kirkland, WA (United States)
 Publication Date:
 Research Org.:
 Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
 Sponsoring Org.:
 USDOE
 OSTI Identifier:
 1390021
 Report Number(s):
 LLNLJRNL738008
Journal ID: ISSN 15496325
 Grant/Contract Number:
 AC5207NA27344
 Resource Type:
 Accepted Manuscript
 Journal Name:
 ACM Transactions on Algorithms
 Additional Journal Information:
 Journal Volume: 12; Journal Issue: 3; Journal ID: ISSN 15496325
 Publisher:
 Association for Computing Machinery
 Country of Publication:
 United States
 Language:
 English
 Subject:
 97 MATHEMATICS AND COMPUTING; Scale free; labeled routing; nameindependent routing; compact routing; doubling dimension
Citation Formats
Konjevod, Goran, Richa, Andréa W., and Xia, Donglin. ScaleFree Compact Routing Schemes in Networks of Low Doubling Dimension. United States: N. p., 2016.
Web. https://doi.org/10.1145/2876055.
Konjevod, Goran, Richa, Andréa W., & Xia, Donglin. ScaleFree Compact Routing Schemes in Networks of Low Doubling Dimension. United States. https://doi.org/10.1145/2876055
Konjevod, Goran, Richa, Andréa W., and Xia, Donglin. Wed .
"ScaleFree Compact Routing Schemes in Networks of Low Doubling Dimension". United States. https://doi.org/10.1145/2876055. https://www.osti.gov/servlets/purl/1390021.
@article{osti_1390021,
title = {ScaleFree Compact Routing Schemes in Networks of Low Doubling Dimension},
author = {Konjevod, Goran and Richa, Andréa W. and Xia, Donglin},
abstractNote = {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 routingscheme design: (i) labeled (namedependent) 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) nameindependent 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 nnode edgeweighted network of doubling dimension α ϵ O(loglog n), we present —a (1 + ε)stretch labeled compact routing scheme with Γlog nbit routing labels, O(log2 n/loglog n)bit packet headers, and ((1/ε)O(α) log3 n)bit routing information at each node; —a (9 + ε)stretch nameindependent 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 nameindependent 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 nameindependent routing scheme achieves asymptotically optimal stretch with polylogarithmic storage at each node and packet headers. Note that both schemes are scalefree in the sense that their space requirements do not depend on the normalized diameter Δ of the network. Finally, we also present a simpler nonscalefree (9 + ε)stretch nameindependent compact routing scheme with improved space requirements if Δ is polynomial in n.},
doi = {10.1145/2876055},
journal = {ACM Transactions on Algorithms},
number = 3,
volume = 12,
place = {United States},
year = {2016},
month = {6}
}
Works referenced in this record:
Routing in Networks with Low Doubling Dimension
conference, January 2006
 Abraham, I.; Gavoille, C.; Goldberg, A. V.
 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06)
Chord: A scalable peertopeer lookup service for internet applications
conference, January 2001
 Stoica, Ion; Morris, Robert; Karger, David
 Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications  SIGCOMM '01
Triangulation and embedding using small sets of beacons
journal, September 2009
 Kleinberg, Jon; Slivkins, Aleksandrs; Wexler, Tom
 Journal of the ACM, Vol. 56, Issue 6
Distance estimation and object location via rings of neighbors
conference, January 2005
 Slivkins, Aleksandrs
 Proceedings of the twentyfourth annual ACM SIGACTSIGOPS symposium on Principles of distributed computing  PODC '05
Compact routing schemes with low stretch factor (extended abstract)
conference, January 1998
 Eilam, Tamar; Gavoille, Cyril; Peleg, David
 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing  PODC '98
Bypassing the embedding: algorithms for low dimensional metrics
conference, January 2004
 Talwar, Kunal
 Proceedings of the thirtysixth annual ACM symposium on Theory of computing  STOC '04
Sparse partitions
conference, January 1990
 Awerbuch, B.; Peleg, D.
 Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
Name independent routing for growth bounded networks
conference, January 2005
 Abraham, Ittai; Malkhi, Dahlia
 Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  SPAA'05
Object location using path separators
conference, January 2006
 Abraham, Ittai; Gavoille, Cyril
 Proceedings of the twentyfifth annual ACM symposium on Principles of distributed computing  PODC '06
Optimalstretch nameindependent compact routing in doubling metrics
conference, January 2006
 Konjevod, Goran; Richa, Andréa W.; Xia, Donglin
 Proceedings of the twentyfifth annual ACM symposium on Principles of distributed computing  PODC '06
Routing in distributed networks: overview and open problems
journal, March 2001
 Gavoille, Cyril
 ACM SIGACT News, Vol. 32, Issue 1
Compact Routing with Minimum Stretch
journal, January 2001
 Cowen, Lenore J.
 Journal of Algorithms, Vol. 38, Issue 1
Compact and localized distributed data structures
journal, September 2003
 Gavoille, Cyril; Peleg, David
 Distributed Computing, Vol. 16, Issue 23
Compact routing schemes
conference, January 2001
 Thorup, Mikkel; Zwick, Uri
 Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures  SPAA '01
Finding nearest neighbors in growthrestricted metrics
conference, January 2002
 Karger, David R.; Ruhl, Matthias
 Proceedings of the thiryfourth annual ACM symposium on Theory of computing  STOC '02
On spacestretch tradeoffs: lower bounds
conference, January 2006
 Abraham, Ittai; Gavoille, Cyril; Malkhi, Dahlia
 Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures  SPAA '06
On spacestretch tradeoffs: upper bounds
conference, January 2006
 Abraham, Ittai; Gavoille, Cyril; Malkhi, Dahlia
 Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures  SPAA '06
Searching dynamic point sets in spaces with bounded doubling dimension
conference, January 2006
 Cole, Richard; Gottlieb, LeeAd
 Proceedings of the thirtyeighth annual ACM symposium on Theory of computing  STOC '06
Fast construction of nets in low dimensional metrics, and their applications
conference, January 2005
 HarPeled, Sariel; Mendel, Manor
 Proceedings of the twentyfirst annual symposium on Computational geometry  SCG '05
Compact oracles for reachability and approximate distances in planar digraphs
journal, November 2004
 Thorup, Mikkel
 Journal of the ACM, Vol. 51, Issue 6
Routing with Polynomial CommunicationSpace Sradeff
journal, May 1992
 Awerbuch, Baruch; Peleg, David
 SIAM Journal on Discrete Mathematics, Vol. 5, Issue 2
Measured Descent: A New Embedding Method for Finite Metrics
conference, January 2004
 Krauthgamer, R.; Lee, J. R.; Mendel, M.
 45th Annual IEEE Symposium on Foundations of Computer Science
Bounded geometries, fractals, and lowdistortion embeddings
conference, January 2003
 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.