Distributed creation and adaptation of random scale-free overlay networks

Proceedings - 2010 4th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2010

Volumn , Issue , 2010, Pages 51-63

  Scholtes, Ingo ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

Adaptation; Overlay networks; Peer to Peer; Scale free; Self organization

Indexed keywords

ADAPTATION; ARBITRARY DEGREE; BIASED RANDOM WALK; DEGREE DISTRIBUTIONS; EQUILIBRIUM MODELS; LARGE-SCALE DISTRIBUTED SYSTEM; OVERLAY TOPOLOGIES; PEER-TO-PEER; POWER LAW DEGREE DISTRIBUTION; RANDOM WALK STRATEGIES; SCALE FREE NETWORKS; SCALE-FREE; SELF-ORGANIZATIONS;

CYBERNETICS; OVERLAY NETWORKS; RANDOM PROCESSES; TOPOLOGY;

PEER TO PEER NETWORKS;

EID: 79952053245     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SASO.2010.45     Document Type: Conference Paper

References (36)

1. L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman. Search in power-law networks. Physical review. E, Statistical, nonlinear, and soft matter physics ., 64, 2001.
2. R. Albert and A.-L. Barabasi. Statistical mechanics of complex networks. Reviews of Modern Physics, 72(1):48-97, 2002.
3. R. Albert, H. Jeong, and A.-L. Barabasi. The diameter of the world wide web. Nature, 401:130, 1999.
4. R. Albert, H. Jeong, and A.-L. Barabasi. Error and attack tolerance of complex networks. Nature, 406:378-382, 2000. (Pubitemid 30625551)
5. Y. Azar, A. Z. Broder, A. R. Karlin, N. Linial, and S. Phillips. Biased random walks. In STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pages 1-9, New York, NY, USA, 1992. ACM.
6. A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286:509-512, 1999.
7. A. Barrat, M. Barthelemy, and A. Vespignani. Dynamical Processes on Complex Networks. Cambridge University Press, 2008.
8. B. Bollobás and I. Riordan. The diameter of a scale-free random graph. Combinatorica, 24:5-34, 2004. (Pubitemid 38706499)
9. P. Boykin, V. Roychowdhury, and N. Sarshar. Percolation search in power law networks: making unstructured peer-to-peer networks scalable. Proceedings of the Fourth International Conference on Peer-to-Peer Computing, 2004.
10. A. Clauset, C. R. Shalizi, and M. E. J. Newman. Power-law distributions in empirical data. SIAM Review, 51:661, 2007.
11. R. Cohen and S. Havlin. Scale-free networks are ultrasmall. Phys. Rev. Lett., 90(5):058701, Feb 2003.
12. P. Diaconis and D. Stroock. Geometric bounds for eigenvalues of markov chains. Ann. Appl. Prob., 1:36-61, 1991.
13. S. N. Dorogovtsev and J. F. F. Mendes. Evolution of networks with aging of sites. Phys. Rev. E, 62(2):1842-1845, Aug 2000.
14. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In SIGCOMM '99: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, pages 251-262, New York, NY, USA, 1999. ACM Press.
15. I. Farkas, I. Derenyi, G. Palla, and T. Vicsek. Equilibrium statistical mechanics of network structures. LECT.NOTES PHYS., 650:163, 2004.
16. C. Gkantsidis, M. Mihail, and A. Saberi. Conductance and congestion in power law graphs. SIGMETRICS Perform. Eval. Rev., 31(1):148-159, 2003.
17. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks: algorithms and evaluation. Perform. Eval., 63(3):241-263, 2006.
18. K. I. Goh, B. Kahng, and D. Kim. Universal behavior of load distribution in scale-free networks. Physical Review Letters, 87:278701, 2001.
19. H. Guclu, D. Kumari, and M. Yuksel. Ad-hoc limited scalefree models for unstructured peer-to-peer networks. CoRR, abs/0806.2395, 2008.
20. W. K. Hastings. Monte carlo sampling methods using markov chains and their applications. Biometrika, 57:97-109, 1970.
21. M. Jelasity, A. Montresor, and O. Babaoglu. Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst., 23(3):219-252, 2005.
22. M. Jelasity, A. Montresor, and O. Babaoglu. T-man: Gossip-based fast overlay topology construction. Comput. Netw., 53(13):2321-2339, 2009.
23. M. Jelasity, S. Voulgaris, R. Guerraoui, A.-M. Kermarrec, and M. van Steen. Gossip-based peer sampling. ACM Trans. Comput. Syst., 25(3):8, 2007.
24. P. L. Krapivsky, S. Redner, and F. Leyvraz. Connectivity of Growing Random Networks. Physical Review Letters, 85:4629-4632, Nov. 2000.
25. D.-S. Lee, K.-I. Goh, B. Kahng, and D. Kim. Evolution of scale-free random graphs: Potts model formulation. Nuclear Physics B, 696:351-380, Sept. 2004.
26. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-peer networks. In Proceedings of the 16th international conference on Supercomputing (ICS 2002), pages 84-95, New York, NY, USA, 2002. ACM.
27. A. Medina, I. Matta, and J. Byers. On the origin of power laws in internet topologies. SIGCOMM Comput. Commun. Rev., 30(2):18-28, 2000.
28. N. Metropolis, A. W. Rosenbluth, A. Teller, and E. Teller. Equations of state calculations by fast computing machines. Journal of Chemical Physics, 21(6):1087-1092, 1953.
29. M. Ripeanu and I. Foster. Revised Papers From the First international Workshop on Peer-To-Peer Systems, chapter Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems, pages 85-93. Springer, 2002.
30. I. Scholtes, J. Botev, M. Esch, A. Hoehfeld, and H. Schloss. Awareness-driven phase transitions in very large scale distributed systems. In Proceedings of the Second IEEE International Conferences on Self-Adaptive and Self-Organizing Systems (SaSo), Venice, Italy. IEEE, October 2008.
31. I. Scholtes, J. Botev, M. Esch, and P. Sturm. Epidemic self-synchronization in complex networks of kuramoto oscillators. Advances in Complex Systems, 13:33-58, 2010.
32. A. Sinclair. Improved bounds for mixing rates of markov chains and multicommodity flow. Combinatorics, Probability and Computing, 1:351-370, 1992.
33. Z. Toroczkai and K. E. Bassler. Jamming is limited in scalefree systems. Nature, 428:716, 2004.
34. H. Zhang, G. Neglia, D. F. Towsley, and G. L. Presti. Stability and efficiency of unstructured file sharing networks. IEEE Journal on Selected Areas in Communications, 26(7):1284-1294, 2008.
35. M. Zhong, K. Shen, and J. Seiferas. Non-uniform random membership management in peer-to-peer networks. In INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, volume 2, pages 1151-1161 vol. 2, march 2005.
36. M. Zhong, K. Shen, and J. Seiferas. The convergence-guaranteed random walk and its applications in peer-to-peer networks. IEEE Trans. Comput., 57(5):619-633, 2008.