Small worlds as navigable augmented networks: Model, analysis, and validation

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

Volumn 4698 LNCS, Issue , 2007, Pages 2-11

  Fraigniaud, Pierre ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; MATHEMATICAL MODELS; MESH GENERATION; ROUTING ALGORITHMS;

ARBITRARY TARGET; DEGREE OF SEPARATION; PROFESSIONAL OCCUPATION; STATE OF LEAVING;

VIRTUAL REALITY;

EID: 38049033533     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75520-3_2     Document Type: Conference Paper

References (43)

1. Abraham, I., Gavoille, C.: Object Location Using Path Separators. In: 25th ACM Symp. on Principles of Distributed Computing (PODC), pp. 188-197. ACM Press, New York (2006)
2. Abraham, I., Malkhi, D., Manku, G.: Brief Announcement: Papillon: Greedy Routing in Rings. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 514-515. Springer, Heidelberg (2005)
3. Andersen, R., Chung, F., Lu, L.: Modeling the small-world phenomenon with local network flow. Internet Mathematics 2(3), 359-385 (2006)
4. Aspnes, J., Diamadi, Z., Shah, G.: Fault-tolerant routing in peer-to-peer systems. In: 21st ACM Symp. on Principles of Distributed Computing (PODC), pp. 223-232. ACM Press, New York (2002)
5. Barrière, L., Fraigniaud, P., Kranakis, E., Krizanc, D.: Efficient Routing in Networks with Long Range Contacts. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 270-284. Springer, Heidelberg (2001)
6. Chung, F., Lu, L.: The small world phenomenon in hybrid power law graphs. Lect. Notes Phys. 650, 89-104 (2004)
7. Coppersmith, D., Gamarnik, D., Sviridenko, M.: The Diameter of a Long-Range Percolation Graph. Random Structures and Algorithms 21(1), 1-13 (2002)
8. Courcelle, B., Makowsky, J., Rotics, U.: Linear-time solvable optimization problems on graphs of bounded cliquewidth. In: Hromkovič, J., Sýkora, O. (eds.) GraphTheoretic Concepts in Computer Science. LNCS, vol. 1517, pp. 1-16. Springer, Heidelberg (1998)
9. Dodds, P., Muhamad, R., Watts, D.: An experimental study of search in global social networks. Science 301(5634), 827-829 (2003)
10. Duchon, P., Hanusse, N., Lebhar, E., Schabanel, N.: Could any graph be turned into a small-world? Theoretical Computer Science 355(1), 96-103 (2006)
11. Duchon, P., Hanusse, N., Lebhar, E., Schabanel, N.: Towards small world emergence. In: 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 225-232. ACM Press, New York (2006)
12. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On Power-law Relationships of the Internet Topology. In: ACM SIGCOMM Conference, pp. 251-262. ACM Press, New York (1999)
13. Flammini, M., Moscardelli, L., Navarra, A., Perennes, S.: Asymptotically optimal solutions for small world graphs. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 414-428. Springer, Heidelberg (2005)
14. Fraigniaud, P.: Greedy routing in tree-decomposed graphs: a new perspective on the small-world phenomenon. In: Brodal, G.S., Lronardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 791-802. Springer, Heidelberg (2005)
15. Fraigniaud, P., Gavoillc, C., Kosowski, A., Lebhar, E., Lotker, Z.: Universal Augmentation Schemes for Network Navigability: Overcoming the √n-Barrier. In: 19th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), ACM Press, New York (2007)
16. Fraigniaud, P., Gavoille, C., Paul, C.: Eclecticism shrinks even small worlds. In: 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 169-178. ACM Press, New York (2004)
17. Fraigniaud, P., Gavoille, C., Paul, C.: Eclecticism shrinks even small worlds. Distributed Computing 18(4) (2006)
18. Fraigniaud, P., Lebhar, E., Lotker, Z.: A doubling dimension threshold Θ(log log n) for augmented graph navigability. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 376-386. Springer, Heidelberg (2006)
19. Fraigniaud, P., Lebhar, E., Lotker, Z.: Recovering the Long Range Links in Augmented Graphs. Technical Report 6197, INRIA Paris-Rocquencourt (May 2007)
20. Fraigniaud, P., Lebhar, E., Viennot, L.: The Inframetric Model for the Internet. Technical Report, INRIA Paris-Rocquencourt (July 2007)
21. Giakkoupis, G., Hadzilacos, V.: On the complexity of greedy routing in ring-based peer-to-peer networks. In: 26th ACM Symposium on Principles of Distributed Computing (PODC), ACM Press, New York (2007)
22. Har-Peled, S., Mendel, M.: Fast Construction of Nets in Low Dimensional Metrics, and Their Applications. SIAM J. on Computing 35(5), 1148-1184 (2006)
23. Karger, D., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: 34th ACM Symp. on the Theory of Computing (STOC), pp. 63-66. ACM Press, New York (2002)
24. Killworth, P., Bernard, H.: Reverse Small-World Experiment. Social Networks 1(2), 159-192 (1978)
25. Kleinberg, J.: The Small-World Phenomenon: An Algorithmic Perspective. In: 32nd ACM Symp. on Theory of Computing (STOC), pp. 163-170. ACM Press, New York (2000)
26. Kleinberg, J.: Navigation in a Small-World. Nature 406, 845 (2000)
27. Kleinberg, J.: Small-World Phenomena and the Dynamics of Information. In: 15th Neural Information Processing Systems (NIPS) (2001)
28. Kleinberg, J.: Complex networks and decentralized search algorithm. Nevanlinna prize presentation at the International Congress of Mathematicians (ICM), Madrid (2006)
29. Kumar, R., Liben-Nowell, D., Tomkins, A.: Navigating Low-Dimensional and Hierarchical Population Networks. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS. vol. 4168, Springer, Heidelberg (2006)
30. Liben-Nowell, D., Novak, J., Kumar, R., Raghavan, P., Tomkins, A.: Geographic routing in social networks. In: Proc. of the Natl. Academy of Sciences of the USA, vol. 102/3, pp. 11623-11628 (2005)
31. Lebhar, E., Schabanel, N.: Searching for Optimal paths in long-range contact networks. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 894-905. Springer, Heidelberg (2004)
32. Manku, G., Bawa, M., Raghavan, P.: Symphony: distributed hashing in a small world. In: 4th USENIX Symp. on Internet Technologies and Systems, pp. 127-140 (2003)
33. Manku, G., Naor, M., Wieder, U.: 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. ACM Press, New York (2004)
34. Martel, C., Nguyen, V.: Analyzing Kleinberg's (and other) Small-world Models. In: 23rd ACM Symp. on Principles of Distributed Computing (PODC), pp. 179-188. ACM Press, New York (2004)
35. Martel, C., Nguyen, V.: Analyzing and characterizing small-world graphs. In: 16th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 311-320. ACM Press, New York (2005)
36. Martel, C., Nguyen, V.: Designing networks for low weight, small routing diameter and low congestion. In: 25th Conference of the IEEE Communications Society (INFOCOM), IEEE Computer Society Press, Los Alamitos (2006)
37. Milgram, S.: The Small-World Problem. Psychology Today, 60-67 (1967)
38. Peleg, D.: Private communication. Workshop of COST Action 295 "DYNAMO", Les Ménuires (January 2006)
39. Plaxton, G., Rajaraman, R., Richa, A.: Accessing Nearby Copies of Replicated Objects in a Distributed Environment. Theory of Computing Systems 32(3), 241 280 (1999)
40. Robertson, N., Seymour, P.D.: Graph minors II, Algorithmic Aspects of Tree-Width. Journal of Algorithms 7, 309-322 (1986)
41. Slivkins, A.: Distance estimation and object location via rings of neighbors. In: 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 41-50. ACM Press, New York (2005)
42. Zegura, E., Calvert, K., Bhattacharjee, S.: How to Model an Internetwork. In: 14th Conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 594-602. IEEE Computer Society Press, Los Alamitos (1996)
43. Zhang, B., Ng, T., Nandi, A., Riedi, R., Druschel, P., Wang, G.: Measurement based analysis, modeling, and synthesis of the internet delay space. In: 6th Internet Measurement Conference (IMC), pp. 85-98 (2006)