Universal augmentation schemes for network navigability: Overcoming the √n-barrier

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2007, Pages 1-7

  Fraigniaud, Pierre ^a   Gavoille, Cyril ^b   Kosowski, Adrian ^c   Lebhar, Emmanuelle ^a   Lotker, Zvi ^d  

^a CNRS   (France)

^b UNIVERSITÉ DE BORDEAUX   (France)

^c GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

^d BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Small world phenomenon

Indexed keywords

GRAPH THEORY; NETWORK ARCHITECTURE; NETWORK ROUTING; PROBABILITY DISTRIBUTIONS;

AUGMENTED GRAPHS; MILGRAM'S EXPERIMENT; NETWORK NAVIGABILITY; RESTRICTED MODEL; SMALL WORLD PHENOMENON;

VIRTUAL REALITY;

EID: 35248894870     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1248377.1248379     Document Type: Conference Paper

References (22)

1. I. Abraham and C. Gavoille. Object Location Using Path Separators. 25th ACM Symp. on Principles of Distributed Computing (PODC), pages 188-197, 2006.
2. J. Aspnes, Z. Diamadi, and G. Shah. Fault-tolerant routing in peer-to-peer systems. In 21st ACM Symp. on Principles of Distributed Computing (PODC), pages 223-232, 2002.
3. L. Barrière, P. Fraigniaud, E. Kranakis, and D. Krizanc. Efficient Routing in Networks with Long Range Contacts. In 15th International Symposium on Distributed Computing (DISC), LNCS 2180, pages 270-284, Springer, 2001.
4. H. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209(1-2):1-45, 1998.
5. A. Brandstädt, V. B. Le, and J. P. Spinrad. Graph Classes - A survey. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 1999.
6. P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel. Could any graph be turned into a small-world? Theoretical Computer Science 355(1): 96-103 (2006).
7. P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel. Towards small world emergence. In 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 225-232, 2006.
8. Y. Dourisboure. Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs. 18th International Conference on Distributed Computing (DISC), LNCS 3274, Springer, pages 365-378, 2004.
9. M. Flammini, L. Moscardelli, A. Navarra, and S. Perennes. Asymptotically optimal solutions for small world graphs. In 19th International Symposium on Distributed Computing (DISC), LNCS 3724, pages 414-428, 2005.
10. P. Fraigniaud. Greedy routing in tree-decomposed graphs: a new perspective on the small-world phenomenon. In 13th Annual European Symposium on Algorithms (ESA), pages 791-802, 2005.
11. 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.
12. P. Fraigniaud, E. Lebhar, and Z. Lotker. A Doubling Dimension Threshold Θ(log log n) for Augmented Graph Navigability. In 14th European Symposium on Algorithm (ESA), LNCS 4168, Springer, pages 376-386, 2006.
13. J. Kleinberg. The Small-World Phenomenon: An Algorithmic Perspective. In 32nd ACM Symp. on Theory of Computing (STOC), pages 163-170, 2000.
14. J. Kleinberg. Complex networks and decentralized search algorithm. In International Congress of Mathematicians (ICM), 2006.
15. E. Lebhar, and N. Schabanel. Searching for Optimal paths in long-range contact networks. In 31st International Colloquium on Automata, Languages and Programming (ICALP), pp. 894-905, 2004.
16. G. Manku, M. Naor, and U. Wieder. Know Thy Neighbor's Neighbor: The Power of Lookahead in Randomized P2P Networks. In 36th ACM Symp. on Theory of Computing (STOC), pages 54-63,2004.
17. C. Martel, and V. Nguyen. Analyzing Kleinberg's (and other) Small-world Models. In 23rd ACM Symp. on Principles of Distributed Computing (PODC), pages 179-188, 2004.
18. S. Milgram. The Small-World Problem. Psychology Today, pages 60-67, 1967.
19. D. Peleg. Private communication. Workshop of COST Action 295 "DYNAMO", Les Ménuires, Jan. 2006.
20. N. Robertson and P. D. Seymour. Graph minors I: Excluding a forest. J. Combin. Theory Ser. B, 35(1):39-61, 1983.
21. A. Slivkins. Distance estimation and object location via rings of neighbors. In 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 41-50, 2005.
22. D. Watts, and S. Strogatz. Collective Dynamics of Small-World Networks. Nature 393:440-442, 1998.