A doubling dimension threshold ⊖ (log log n) for augmented graph navigability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4168 LNCS, Issue , 2006, Pages 376-386

  Fraigniaud, Pierre ^a   Lebhar, Emmanuelle ^b   Lotker, Zvi ^c  

^a CNRS   (France)

^b UNIV LYON   (France)

^c CWI   (Netherlands)

Author keywords

Doubling dimension; Greedy routing; Small world

Indexed keywords

COMPUTATIONAL METHODS; ROUTERS; VIRTUAL REALITY;

DOUBLING DIMENSION; GRAPH NAVIGABILITY; GREEDY ROUTING; SMALL WORLDS;

COMPUTER GRAPHICS;

EID: 33750701136     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_35     Document Type: Conference Paper

References (24)

1. I. Abraham, C. Gavoille, A. V. Goldberg, and D. Malkhi. Routing in networks with low doubling dimension. In 26th International Conference on Distributed Computing Systems (ICDCS), to appear, 2006.
2. th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA), pages 49-55, 2005.
3. J. Aspnes, Z. Diamadi, and G. Shah. Fault-tolerant routing in peer-to-peer systems. In In 21st ACM Symp. on Principles of Distributed Computing (PODC), pages 223-232, 2002.
4. n. Bull. Soc. Math., 111(4):429-448, 1983.
5. L. Barrière, P. Fraigniaud, E. Kranakis, and D. Krizanc. Efficient routing in networks with long range contacts. In LNCS Proceedings of 15th International Symposium on Distributed Computing (DISC), volume 2180, pages 270-284, 2001.
6. H.T-H. Chan, A. Gupta, B. M. Maggs, and S. Zhou. On hierarchical routing in doubling metrics. In Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms (SODA), pages 762-771, 2005.
7. K. L. Clarkson. Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, chapter Nearest-neighbor searching and metric space dimensions. (Survey). MIT Press, T. Darrell, P. Indyk, G. Shakhnarovich, and P. Viola, editors, 2006.
8. P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel. Could any graph be turned into a small world? Theoretical Computer Science, Special issue on Complex Networks, volume 355(1), pages 96-103, 2006.
9. M. Flammini, L. Moscardelli, A. Navarra, and S. Perennes. Asymptotically optimal solutions for small world graphs. In LNCS Proceedings of the 19th International Symposium on Distributed Computing (DISC), volume 3724, pages 414-428, 2005.
10. M. Fomenkov, K. Claffy, B. Huffaker, and D. Moore. Macroscopic internet topology and performance measurements from the dns root name servers. In USENIX LISA, 2001.
11. P. Fraigniaud. Greedy routing in tree-decomposed graphs: a new perspective on the small-world phenomenon. In Proceedings of the 13th Annual European Symposium on Algorithms (ESA), pages 791-802, 2005.
12. P. Fraigniaud, C. Gavoille, and C. Paul. Eclecticism shrinks even small worlds. In Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC), pages 169-178, 2004.
13. A. Gupta, R. Krauthgamer, and J.R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 534-543, 2003.
14. S. Har-Peled and M. Mendel. Fast construction of nets in low dimensional metrics and their applications. In Proceedings of the 21th ACM Symposium on Computational Geometry (SoCG), pages 150-158, 2005.
15. J. Heinonen. Lectures on analysis on metric spaces. Springer-Verlag, New York, 2001.
16. D. R. Karger and M. Ruhl. Finding nearest-neighbors in growth-restricted metrics. In Proceedings of the 34th annual ACM symposium on Theory of computing (STOC), pages 741-750, 2002.
17. J. Kleinberg. The Small-World Phenomenon: An Algorithmic Perspective. In Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC), pages 163-170, 2000.
18. J. Kleinberg. Complex networks and decentralized search algorithm. In Proceedings of the International Congress of Mathematicians (ICM), 2006. To appear.
19. E. Lebhar and N. Schabanel. Close to optimal decentralized routing in long-range contact networks. Theoretical Computer Science special issue on ICALP'04, 348(2-3):294-310, 2005.
20. G. S. Manku, M. Naor, and U. Wieder. 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), pages 54-63, 2004.
21. C. Martel and V. Nguyen. Analyzing Kleinberg's (and other) small-world models. In In 23rd ACM Symp. on Principles of Distributed Computing (PODC), pages 178-187, 2004.
22. S. Milgram. The small world problem. Psychology Today, 61(1), 1967.
23. D. Peleg. Private communication, 2006.
24. A. Slivkins. Distance estimation and object location via rings of neighbors. In Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 41-50, 2005.