Searching method through biased random walks on complex networks

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volumn 80, Issue 1, 2009, Pages

  Lee, Sungmin ^a   Yook, Soon Hyung ^a   Kim, Yup ^a  

^a Kyung Hee University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

BIASED RANDOM WALK; COMPLEX NETWORKS; DIFFUSING PARTICLES; DYNAMICAL PROCESS; EFFICIENT METHOD; FIRST-PASSAGE; INFORMATION SEARCH; NETWORK TOPOLOGY; NETWORK TRAFFIC; NUMERICAL SIMULATION; PEER-TO-PEER SYSTEM; SEARCHING METHODS; SEARCHING TIME; TOPOLOGICAL STRUCTURE; UNDERLYING NETWORKS;

CLIENT SERVER COMPUTER SYSTEMS; COMPUTER SIMULATION LANGUAGES; INTERNET; STRUCTURAL OPTIMIZATION;

ELECTRIC NETWORK TOPOLOGY;

EID: 68949119368     PISSN: 15393755     EISSN: 15502376     Source Type: Journal    
DOI: 10.1103/PhysRevE.80.017102     Document Type: Article

References (32)

1. J. M. Kleinberg, Nature (London) 406, 845 (2000). 10.1038/35022643
2. L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman, Phys. Rev. E 64, 046135 (2001). 10.1103/PhysRevE.64.046135
3. C. P. Herrero, Phys. Rev. E 71, 016103 (2005) 10.1103/PhysRevE.71.016103
4. S.-J. Yang, Phys. Rev. E 71, 016107 (2005) 10.1103/PhysRevE.71.016107
5. H. P. Thadakamalla, R. Albert, and S. R. T. Kumara, Phys. Rev. E 72, 066128 (2005). 10.1103/PhysRevE.72.066128
6. S. Lee, S.-H. Yook, and Y. Kim, Physica A 385, 743 (2007). 10.1016/j.physa.2007.07.022
7. S. Lee, S.-H. Yook, and Y. Kim, Phys. Rev. E 74, 046118 (2006). 10.1103/PhysRevE.74.046118
8. R. Pastor-Satorras and A. Vespignani, Phys. Rev. Lett. 86, 3200 (2001) 10.1103/PhysRevLett.86.3200
9. R. Pastor-Satorras and A. Vespignani, Phys. Rev. E 63, 066117 (2001). 10.1103/PhysRevE.63.066117
10. S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.-U. Hwang, Phys. Rep. 424, 175 (2006). 10.1016/j.physrep.2005.10.009
11. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, Search and Replication in Unstructured Peer-to-Peer Networks, Proceedings of the 16th Annual ACM International Conference on Supercomputing, New York City, USA, 2002 (unpublished).
12. R. Pastor-Satorras and A. Vespignani, Evolution and Structure of the Internet: A Statistical Physics Approach (Cambridge University Press, Cambridge, England, 2004).
13. D. Stutzbach and R. Rejaie, Capturing Accurate Snapshots of the Gnutella Networks, Global Internet Symposium, 2005, Vol. 125.
14. D. Stutzbach and R. Rejaie, Proceedings of the 2005 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, (ACM, New York, 2005), p. 402, extended abstract.
15. M. A. Jovanovic, F. S. Annexstein, and K. A. Berman, University of Cincinnati, Technical report, 2001 (unpublished).
16. M. Ripeanu, I. Foster, and A. Iamnitchi, IEEE Internet Comput. 6, 50 (2002).
17. R. Albert and A.-L. Barabábasi, Rev. Mod. Phys. 74, 47 (2002). 10.1103/RevModPhys.74.47
18. D. Stutzbach and R. Rejaie, IEEE/ACM Trans. Netw. 16, 267 (2008). 10.1109/TNET.2007.900406
19. http://www.theregister.co.uk/2003/10/14/edonkey-rides-like-the-wind/
20. D. Plonka, Uw-Madison Napster Traffic Measurement, http://net.doit.wisc. edu/data/Napster, 2000.
21. J. Buford and K. Ross, P2P Overlay Design Overview, IETF P2P-SIP Ad Hoc Meeting, 2005 (unpublished).
22. BitTorrent Protocol Specification, http://www.bittorrent.org/protocol. html
23. W. Nejdl, EDUTELLA: A P2P Networking Infrastructure Based on RDF (ACM Press, New York, 2005).
24. Gnutella Protocol Specification v0.4 and v0.6.
25. http://www.kazaa.com
26. J. D. Noh and H. Rieger, Phys. Rev. Lett. 92, 118701 (2004). 10.1103/PhysRevLett.92.118701
27. S. Kwon, S. Lee, and Y. Kim, Phys. Rev. E 73, 056102 (2006). 10.1103/PhysRevE.73.056102
28. In practice, the names of the files in the information packet can be restricted to those which are intended to be shared by the owner for the security.
29. S. Kwon, S. Yoon, and Y. Kim, Phys. Rev. E 77, 066105 (2008). 10.1103/PhysRevE.77.066105
30. K.-I. Goh, B. Kahng, and D. Kim, Phys. Rev. Lett. 87, 278701 (2001). 10.1103/PhysRevLett.87.278701
31. S. Yoon, S. Lee, S.-H. Yook, and Y. Kim, Phys. Rev. E 75, 046114 (2007). 10.1103/PhysRevE.75.046114
32. Since f (t) of FB algorithm is an exponential function of tTTL, f (t) of FB can be smaller than that of BNLL when tTTL is very small. However, when tTTL is less than or equal to the obtained T 's in Figs. 1 2, many packets fail to find the requested information and T diverges. Thus, tTTL should be much larger than the obtained T (4-5). As a result, f (t) of FB always exceeds that of BNLL when T is finite.