Networks become navigable as nodes move and forget

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

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 133-144

  Chaintreau, Augustin ^a   Fraigniaud, Pierre ^b   Lebhar, Emmanuelle ^b  

^a FCA UNESP   (Brazil)

^b CNRS   (France)

Author keywords

Dynamic process; Random walks; Resource location; Routing; Small world phenomenon; Spatial gossip

Indexed keywords

LINGUISTICS; ROUTING ALGORITHMS; TRANSLATION (LANGUAGES);

DYNAMIC PROCESS; DYNAMIC PROCESSES; FORMAL PROOFS; GREEDY ROUTING; HARMONIC DISTRIBUTIONS; LONG-RANGE LINKS; NETWORK EVOLUTION; POLYLOGARITHMIC; RANDOM WALKS; RESOURCE LOCATION; ROUTING; SMALL WORLD PHENOMENON; SMALL WORLDS; SPATIAL GOSSIP; STATIONARY REGIMES;

PROCESS ENGINEERING;

EID: 49049116944     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_12     Document Type: Conference Paper

References (36)

1. Abraham, I., Gavoille, C.: Object Location Using Path Separators. In: 25th ACM Symp. on Principles of Distributed Computing (PODC), pp. 188-197 (2006)
2. Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Review of modern physics 74, 47-97 (2002)
3. 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 (2002)
4. 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)
5. Bollobás, B., Chung, F.: The diameter of a cycle plus a random matching. SIAM J. Discrete Math. 1(3), 328-333 (1988)
6. Bremaud, P.: Markov Chains, Gibbs Field, Monte Carlo Simulation and Queues. Springer, Heidelberg (1999)
7. Chaintreau, A., Fraigniaud, P., Lebhar, E.: Opportunistic spatial gossip over mobile social networks. In: 1st ACM SIGCOMM Workshop on Online Social Net (WOSN) (to appear, 2008)
8. Chaintreau, A., Fraigniaud, P., Lebhar, E.: Networks Become Navigable as Nodes Move and Forget. Technical Report, arXiv:0803.0248v1 (2008)
9. Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Scott, J., Gass, R.: Impact of Human Mobility on Opportunistic Forwarding Algorithms. IEEE Trans. Mob. Comp. 6(6), 606-620 (2007)
10. Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A Distributed Anonymous Information Storage and Retrieval System. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 46-66. Springer, Heidelberg (2001)
11. Clauset, A., Moore, C.: How Do Networks Become Navigable? Technical Report, arXiv:0309.415v2 (2003)
12. Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic Algorithms for Replicated Database Maintenance. Operating Systems Review 22(1), 8-32 (1988)
13. Dodds, P., Muhamad, R., Watts, D.: An experimental study of search in global social networks. Science 301(5634), 827-829 (2003)
14. Duchon, P., Eggeman, N., Hanusse, N.: Non-Searchability of Random Power Law Graphs. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol. 4878. Springer, Heidelberg (2007)
15. 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)
16. 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)
17. Fraigniaud, P.: Greedy routing in tree-decomposed graphs: a new perspective on the small-world phenomenon. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 791-802. Springer, Heidelberg (2005)
18. Fraigniaud, P., Gauron, P., Latapy, M.: Combining the Use of Clustering and Scale-Free Nature of User Exchanges into a Simple and Efficient P2P System. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648, pp. 1163-1172. Springer, Heidelberg (2005)
19. Fraigniaud, P., Gavoille, 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), pp. 1-9 (2007)
20. Fraigniaud, P., Lebhar, E., Lotker, Z.: A Doubling Dimension Threshold Θ(log logn) for Augmented Graph Navigability. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 376-386. Springer, Heidelberg (2006)
21. Giakkoupis, G., Hadzilacos, V.: On the complexity of greedy routing in ring-based peer-to-peer networks. In: 26th ACM Symp. on Princ. of Dist. Comp. (PODC) (2007)
22. Grossglauser, M., Tse, D.: Mobility Increases the Capacity of Ad Hoc Wireless Networks. IEEE/ACM Trans. on Net. 10(4), 477-486 (2002)
23. Jain, S., Fall, K., Patra, R.: Routing in a delay tolerant network. In: Proc. ACM SIGCOMM (2004)
24. Kempe, D., Kleinberg, J., Demers, A.: Spatial gossip and resource location protocols. In: 33rd ACM Symposium on Theory of Computing, pp. 163-172 (2001)
25. Kempe, D., Kleinberg, J.: Protocols and impossibility results for gossip-based communication mechanisms. In: 43st IEEE Symp. on Foundations of Computer Science, pp. 471-480 (2002)
26. Kleinberg, J.: The small-world phenomenon: an algorithmic perspective. In: 32nd ACM Symp. on Theory of Computing (STOC), pp. 163-170 (2000)
27. Kleinberg, J.: Complex networks and decentralized search algorithm. In: International Congress of Mathematicians (ICM), Madrid (2006)
28. 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)
29. Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. Journal of the American society for information science and technology 58(7), 1019-1031 (2007)
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. Milgram, S.: The Small-World Problem. Psychology Today, pp. 60-67 (1967)
32. Sandberg, O.: Neighbor Selection and Hitting Probability in Small-World Graphs. Annals of Applied Probability (to appear, 2008)
33. Sandberg, O., Clarke, I.: The evolution of navigable small-world networks. Tech. Report 2007:14, Chalmers University of Technology (2007)
34. Simon, H.: On a class of skew distribution functions. Biometrika 42(3/4), 425-440 (1955)
35. Slivkins, A.: Distance estimation and object location via rings of neighbors. In: 24th Annual ACM Symp. on Princ. of Dist. Comp. (PODC), pp. 41-50 (2005)
36. Watts, D., Strogatz, S.: Collective Dynamics of Small-World Networks. Nature 393, 440-442 (1998)