Abstract
In his seminal work, Kleinberg showed how to augment meshes using random edges, so that they become navigable; that is, greedy routing computes paths of polylogarithmic expected length between any pairs of nodes. This yields the crucial question of determining wether such an augmentation is possible for all graphs. In this paper, we answer negatively to this question by exhibiting a threshold on the doubling dimension, above which an infinite family of graphs cannot be augmented to become navigable whatever the distribution of random edges is. Precisely, it was known that graphs of doubling dimension at most O(loglogn) are navigable. We show that for doubling dimension ≫loglogn, an infinite family of graphs cannot be augmented to become navigable. Finally, we complete our result by studying the special case of square meshes, that we prove to always be augmentable to become navigable.
The results contained in this paper were partially obtained when the two first authors were visiting CWI (Centrum voor Wiskunde en Informatica) in the Netherlands. Additional support from CWI.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abraham, I., Gavoille, C., Goldberg, A.V., Malkhi, D.: Routing in networks with low doubling dimension. In: 26th International Conference on Distributed Computing Systems (ICDCS) (to appear, 2006)
Abraham, I., Malkhi, D.: Name independent routing for growth bounded networks. In: 17th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA), pp. 49–55 (2005)
Aspnes, J., Diamadi, Z., Shah, G.: Fault-tolerant routing in peer-to-peer systems. In: 21st ACM Symp. on Principles of Distributed Computing (PODC), pp. 223–232 (2002)
Assouad, P.: Plongements lipshitzien dans R n. Bull. Soc. Math. 111(4), 429–448 (1983)
Barrière, L., Fraigniaud, P., Kranakis, E., Krizanc, D.: Efficient routing in networks with long range contacts. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 270–284. Springer, Heidelberg (2001)
Chan, H.T.-H., Gupta, A., Maggs, B.M., Zhou, S.: On hierarchical routing in doubling metrics. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 762–771 (2005)
Clarkson, K.L.: Nearest-Neighbor Methods for Learning and Vision: Theory and Practice. In: Darrell, T., Indyk, P., Shakhnarovich, G., Viola, P. (eds.) Nearest-neighbor searching and metric space dimensions (Survey). MIT Press, Cambridge (2006)
Duchon, P., Hanusse, N., Lebhar, E., Schabanel, N.: Could any graph be turned into a small world? Theoretical Computer Science 355(1), 96–103 (2006); Special issue on Complex Networks
Flammini, M., Moscardelli, L., Navarra, A., Perennes, S.: Asymptotically optimal solutions for small world graphs. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 414–428. Springer, Heidelberg (2005)
Fomenkov, M., Claffy, K., Huffaker, B., Moore, D.: Macroscopic internet topology and performance measurements from the DNS root name servers. In: USENIX LISA (2001)
Fraigniaud, P.: Greedy routing in tree-decomposed graphs. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 791–802. Springer, Heidelberg (2005)
Fraigniaud, P., Gavoille, C., Paul, C.: Eclecticism shrinks even small worlds. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 169–178 (2004)
Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 534–543 (2003)
Har-Peled, S., Mendel, M.: Fast construction of nets in low dimensional metrics and their applications. In: Proceedings of the 21th ACM Symposium on Computational Geometry (SoCG), pp. 150–158 (2005)
Heinonen, J.: Lectures on analysis on metric spaces. Springer, New York (2001)
Karger, D.R., Ruhl, M.: Finding nearest-neighbors in growth-restricted metrics. In: Proceedings of the 34th annual ACM Symposium on Theory of Computing (STOC), pp. 741–750 (2002)
Kleinberg, J.: The Small-World Phenomenon: An Algorithmic Perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC), pp. 163–170 (2000)
Kleinberg, J.: Complex networks and decentralized search algorithm. In: Proceedings of the International Congress of Mathematicians (ICM) (to appear, 2006)
Lebhar, E., Schabanel, N.: Close to optimal decentralized routing in long-range contact networks. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 294–310. Springer, Heidelberg (2004)
Manku, G.S., Naor, M., Wieder, U.: Know thy neighbor’s neighbor: the power of lookahead in randomized p2p networks. In: Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), pp. 54–63 (2004)
Martel, C., Nguyen, V.: Analyzing Kleinberg’s (and other) small-world models. In: 23rd ACM Symp. on Principles of Distributed Computing (PODC), pp. 178–187 (2004)
Milgram, S.: The small world problem. Psychology Today 61(1) (1967)
Peleg, D.: Private communication (2006)
Slivkins, A.: Distance estimation and object location via rings of neighbors. In: Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 41–50 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fraigniaud, P., Lebhar, E., Lotker, Z. (2006). A Doubling Dimension Threshold Θ(loglogn) for Augmented Graph Navigability. In: Azar, Y., Erlebach, T. (eds) Algorithms – ESA 2006. ESA 2006. Lecture Notes in Computer Science, vol 4168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11841036_35
Download citation
DOI: https://doi.org/10.1007/11841036_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38875-3
Online ISBN: 978-3-540-38876-0
eBook Packages: Computer ScienceComputer Science (R0)