Towards small world emergence

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn 2006, Issue , 2006, Pages 225-232

  Duchon, Philippe ^a   Hanusse, Nicolas ^a   Lebhar, Emmanuelle ^b   Schabanel, Nicolas ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIV LYON   (France)

Author keywords

Bounded growth; Distributed algorithms; Routing algorithms; Small world

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; PROBABILITY; ROUTERS; VIRTUAL REALITY;

AUGMENTED NETWORK; DISTRIBUTED ALGORITHMS; MULTILAYER SAMPLING; ROUTING ALGORITHMS;

COMPUTER NETWORKS;

EID: 33749576174     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1148109.1148145     Document Type: Conference Paper

References (21)

1. th ACM Symp. on Parallel Alg. and Archi. (SPAA), pages 20-24, 2004.
2. th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA), pages 49-55, 2005.
3. L. Barrière, P. Fraigniaud, E. Kranakis, and D. Krizanc. Efficient routing in networks with long range contacts. In Proc. of 15th Inter. Symp. on Distr. Comp. (DISC), volume 2180, pages 270-284, 2001.
4. P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel. Brief announcement: Could any graph be turned into a small world? Proc. of the 19th Inter. Symp. on Distr. Comp. (DISC), pages 511-513, 2005.
5. 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.
6. P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel. A fully distributed scheme to turn a network into a small world. Technical Report RR2006-03, LIP - ENS Lyon, 2006.
7. P. Fraigniaud. Greedy routing in tree-decomposed graphs: a new perspective on the small-world phenomenon. In Proc. of the 13th European Symposium on Algorithms (ESA). pages 791-802, 2005.
8. P. Fraigniaud and P. Gauron. Brief annoucement: an overview of the content-addressable network d2b. In Proc of the ACM 22st Symp. on Princ. of Distr. Comp. (PODC), page 151, 2003.
9. J. Gao, L. J. Guibas, and A. Nguyen. Deformable spanners and applications. In Proc. of the 20th ACM Symp. on Computational Geometry (SoCG), pages 190-199, 2004.
10. C. Gavoille and D. Peleg. Compact and localized distributed data structures. Journal of Distributed Computing, 16:111-120, 2003. PODC 20-Year Special Issue.
11. S. Har-Paled and M. Mendel. Fast construction of nets in low dimensional metrics and their applications. In Proc. of the 21th ACM Symp. on Computational Geometry (SoCG), 2005.
12. 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.
13. J. Kleinberg. Small-world phenomena and the dynamics of information. In Advances in Neural Information Processing Systems (NIPS) 14, 2002.
14. R. Krauthgamer and J. R. Lee. Navigating nets: simple algorithms for proximity search. In Proc. of the 15th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 798-807, 2004.
15. S. Milgram. The small world problem. Psychology Today, 61(1), 1967.
16. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
17. S. Ratsanamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of the ACM SIGCOMM, pages 161-170, 2001.
18. E. G. Sirer, A. Slivkins, and B. Wong. Meridian: A lightweight network location service without virtual coordinates. In Proceedings of the ACM SIGCOMM, 2005.
19. th ACM Symp. on Principles of Distributed Computing (PODC), pages 41-50, 2005.
20. I. Stoica, R. Morris, D. R. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. of the ACM SIGCOMM, pages 149-160, 2001.
21. M. Thorup and U. Zwick. Approximate distance oracles. Journal of the ACM, 52(1):l-24, 2005.