Polylogarithmic network navigability using compact metrics with small stretch

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2008, Pages 62-69

  Fraigniaud, Pierre ^a   Gavoille, Cyril ^b  

^a CNRS   (France)

^b UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Network navigability; Small world phenomenon; Social networks

Indexed keywords

ARBITRARY GRAPHS; GENERAL FRAMEWORKS; GRAPH AUGMENTATIONS; GREEDY ROUTING; NETWORK NAVIGABILITY; NODE GRAPHS; OF GRAPHS; POLYLOGARITHMIC; SHORTEST PATH DISTANCES; SHORTEST PATHS; SMALL WORLD PHENOMENON; SOCIAL NETWORKS; UNIVERSAL BOUNDS;

COMPUTER NETWORKS;

EID: 57349084069     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1378533.1378542     Document Type: Conference Paper

References (31)

1. I. Abraham and C. Gavoille. Object Location Using Path Separators. 25th ACM Symp. on Principles of Distributed Computing (PODC), pp. 188-197, 2006.
2. J. Aspnes, Z. Diamadi, and G. Shah. Fault-tolerant routing in peer-to-peer systems. In 21st ACM Symip. on Principles of Distributed Computing (PODC), pp. 223-232, 2002.
3. B. Awerbuch, D. Peleg. Sparse Partitions. In 31st IEEE Symp. on Foundations of Computer Science (FOCS), pp. 503-513, 1990.
4. L. Barrière, P. Fraigniaud, E. Kranakis, and D. Krizanc. Efficient Routing in Networks with Long Range Contacts. In 15th International Symp. on Distributed Computing (DISC), LNCS 2180, pp. 270-284, Springer, 2001.
5. S. Banerjee, T. Griffin, and M. Pias. The interdomain connectivity of PlanetLab nodes. In 5th Workshop on Passive and Active Measurements, LNCS 3015, pp. 73-82, Springer, 2004.
6. D. Barbella, G. Kachergis, D. Liben-Nowell, A. Sallstrom, and B. Sowell. Depth of field and cautious-greedy routing in social networks. In 18th International Symp. on Algo. and Computation (ISAAC), LNCS 4835, pp. 574-586. Springer, 2007.
7. A. Clauset and C. Moore How Do Networks Become Navigable? http://arxiv.org/abs/cond-mat/0309415v2.
8. P. Dodds, R. Muhamad, and D. Watts. An experimental study of search in global social networks. Science 301, no5634, pp. 827-829, 2003.
9. P. Duchon, N. Hanusse, E. Lebliar, and N. Schabanel. Could any graph be turned into a small-world? Theoretical Computer Science 355(1): 96-103 (2006).
10. P. Duchon, N. Hanusse, E. Lebliar, and N. Schabanel. Towards small world emergence. In 18th ACM Symp. on Parallel Algo. and Architectures (SPAA), pp. 225-232, 2006.
11. G. Giakkoupis and V. Hadzilacos On the complexity of greedy routing in ring-based peer-to-peer networks In 26th ACM Symp. on Principles of Distributed Computing (PODC), pp. 99-108, 2007.
12. C. Gavoille, M. Katz, N. A. Katz, C. Paul, and D. Peleg. Approximate distance labeling schemes. In 9th Europ. Symp. on Algo. (ESA), LNCS 2161, pp. 476-488. Springer, 2001.
13. C. Gavoille, D. Peleg, S. Pèrennés, and R. Raz. Distance Labeling in Graphs. J. of Algorithms, 53(1):85-112, 2004.
14. M. Flammini, L. Moscardelli, A. Navarra, and S. Perennes. Asymptotically optimal solutions for small world graphs. In 19th International Symp. on Distributed Computing (DISC), LNCS 3724, Springer, pp. 414-428, 2005.
15. P. Fraigniaud. Greedy Routing in Tree-Decomposed Graphs. In 13th Europ. Symp. on Algo. (ESA), LNCS 3669, Springer, pp. 791-802, 2005.
16. P. Fraigniaud. Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation. In 15th Europ. Symp. on Algo. (ESA), LNCS 4698, Springer, pp. 2-11, 2007.
17. P. Fraigniaud, C. Gavoille, and C. Paul. Eclecticism shrinks even small worlds. In Proceedings of the 23rd ACM Symp. on Principles of Distributed Computing (PODC), pp. 169-178, 2004.
18. P. Fraigniaud, C. Gavoille, A. Kosowski, E. Lebhar, and Z. Lotker. Universal augmentation schemes for network navigability: overcoming the √n-barrier. In 19th ACM Symp. on Parallelism in Algo. and Architectures (SPAA), pp. 1-7, 2007.
19. P. Fraigniaud, E. Lebhar, and Z. Lotker. A doubling dimension threshold θ(log log n) for augmented graph navigability. In 14th Europ. Symp. on Algorithm (ESA), LNCS 4168, Springer /pp. 376-386, 2006.
20. P. Fraigniaud, E. Lebhar, and L. Viennot. The inframetric model for the internet. In 27th IEEE Conference on Computer Communications (INFOCOM), 2008.
21. J. Kleinberg. The small-world phenomenon: an algorithmic perspective. In 32nd ACM Symp. on Theory of Computing (STOC), pp. 163-170, 2000.
22. J. Kleinberg. Complex networks and decentralized search algorithm. Nevanlinna prize presentation at the International Congress of Mathematicians (ICM), Madrid, 2006.
23. E. Lebhar, and N. Schabanel. Searching for Optimal paths in long-range contact networks. In 31st International Colloquium on Automata, Languages and Programming (ICALP), LNCS 3142, pp. 894-905, 2004.
24. 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), pp. 54-63,2004.
25. C. Martel, and V. Nguyen. Analyzing Kleinberg's (and other) Small-world Models. In 23rd ACM Symp. on Principles of Distributed Computing (PODC), pp. 179-188, 2004.
26. C. Martel, and V. Nguyen. Analyzing and characterizing small-world graphs. In 16th ACM-SIAM Symp. on Discrete Algo. (SODA), pp. 311-320, 2005.
27. S. Milgram, The Small-World Problem. Psychology Today, pp. 60-67, 1967.
28. D. Peleg. Private communication. Workshop of COST Action 295 "DYNAMO", Les Ménuires, Jan. 2006.
29. O. Sandberg. Neighbor Selection and Hitting Pobability in Small-World Graphs. Annals of Applied robability (to appear).
30. A. Slivkins. Distance estimation and object location via rings of neighbors. In 24th ACM Symp. on Principles of Distributed Computing (PODC), pp. 41-50, 2005.
31. M. Thorup, and U. Zwick. Approximate Distance Oracles. J. of the ACM, 52:1-14, 2005.