A Doubling Dimension Threshold Theta(loglogn) for Augmented Graph Navigability

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.

[1]  Moni Naor,et al.  Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks , 2004, STOC '04.

[2]  Lali Barrière,et al.  Efficient Routing in Networks with Long Range Contacts , 2001, DISC.

[3]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[4]  Aleksandrs Slivkins.  Distance estimation and object location via rings of neighbors , 2005, PODC '05.

[5]  Ittai Abraham,et al.  Name independent routing for growth bounded networks , 2005, SPAA '05.

[6]  Nicolas Schabanel,et al.  Close to optimal decentralized routing in long-range contact networks , 2005, Theor. Comput. Sci..

[7]  Andrew V. Goldberg,et al.  Routing in Networks with Low Doubling Dimension , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[8]  Pierre Fraigniaud,et al.  Greedy Routing in Tree-Decomposed Graphs , 2005, ESA.

[9]  Stefano Leonardi,et al.  Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, ESA.

[10]  Robert Krauthgamer,et al.  Bounded geometries, fractals, and low-distortion embeddings , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[11]  Charles U. Martel,et al.  Analyzing Kleinberg's (and other) small-world Models , 2004, PODC '04.

[12]  David Moore,et al.  Macroscopic Internet Topology and Performance Measurements from the DNS Root Name Servers , 2001, LISA.

[13]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[14]  Sariel Har-Peled,et al.  Fast construction of nets in low dimensional metrics, and their applications , 2004, SCG.

[15]  Bruce M. Maggs,et al.  On hierarchical routing in doubling metrics , 2005, SODA '05.

[16]  James Aspnes,et al.  Fault-tolerant routing in peer-to-peer systems , 2002, PODC '02.

[17]  David R. Karger,et al.  Finding nearest neighbors in growth-restricted metrics , 2002, STOC '02.

[18]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[19]  Pierre Fraigniaud,et al.  Eclecticism shrinks even small worlds , 2004, PODC '04.

[20]  Patrice Assouad.  Plongements lipschitziens dans ${\mathbb {R}}^n$ , 1983 .

[21]  P. Fraigniaud.  A New Perspective on the Small-World Phenomenon: Greedy Routing in Tree-Decomposed Graphs , 2005 .

[22]  J. Heinonen.  Lectures on Analysis on Metric Spaces , 2000 .

[23]  Stéphane Pérennes,et al.  Asymptotically Optimal Solutions for Small World Graphs , 2005, DISC.