메뉴 건너뛰기




Volumn 355, Issue 1, 2006, Pages 48-64

Scalable percolation search on complex networks

Author keywords

Peer to peer networks; Percolation search algorithm; Scalable search; Unstructured complex networks

Indexed keywords

PEER-TO-PEER NETWORKS; SCALABLE SEARCH; UNSTRUCTURED COMPLEX NETWORKS;

EID: 33644868794     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.12.014     Document Type: Article
Times cited : (12)

References (25)
  • 2
    • 84858565175 scopus 로고    scopus 로고
    • homepage, http://www.morpheus.com/index.html, 2004.
    • (2004)
  • 3
    • 84858565521 scopus 로고    scopus 로고
    • homepage, http://www.imesh.com/, 2004.
    • (2004)
  • 7
    • 0036013593 scopus 로고    scopus 로고
    • Statistical mechanics of complex networks
    • R. Albert, and A.-L. Barabási Statistical mechanics of complex networks Rev. Modern Phys. 74 2002 47 97
    • (2002) Rev. Modern Phys. , vol.74 , pp. 47-97
    • Albert, R.1    Barabási, A.-L.2
  • 8
    • 18744421488 scopus 로고    scopus 로고
    • Mean-field theory for scale-free random networks
    • A.-L. Barabási, R. Albert, and H. Jeong Mean-field theory for scale-free random networks Physica A 272 2000 173 187
    • (2000) Physica A , vol.272 , pp. 173-187
    • Barabási, A.-L.1    Albert, R.2    Jeong, H.3
  • 9
    • 0000188718 scopus 로고    scopus 로고
    • Hot: Robustness and design in complex systems
    • J.M. Carlson, and J. Doyle Hot: robustness and design in complex systems Phys. Rev. Lett. 84 2000 2529 2532
    • (2000) Phys. Rev. Lett. , vol.84 , pp. 2529-2532
    • Carlson, J.M.1    Doyle, J.2
  • 16
    • 84990671447 scopus 로고
    • A critical point for random graphs with a given degree sequence
    • M. Molloy, and B. Reed A critical point for random graphs with a given degree sequence Random Struct. Algorithms 6 1995 161 179
    • (1995) Random Struct. Algorithms , vol.6 , pp. 161-179
    • Molloy, M.1    Reed, B.2
  • 17
    • 0035420732 scopus 로고    scopus 로고
    • Random graphs with arbitrary degree distributions and their applications
    • M.E.J. Newman, S.H. Strogatz, and D.J. Watts Random graphs with arbitrary degree distributions and their applications Phys. Rev. E 64 2001 026118
    • (2001) Phys. Rev. e , vol.64 , pp. 026118
    • Newman, M.E.J.1    Strogatz, S.H.2    Watts, D.J.3
  • 18
    • 0036187056 scopus 로고    scopus 로고
    • Mapping the Gnutella network: Properties of large-scale peer-to-peer systems and implications for system design
    • M. Ripeanu, I. Foster, and A. Iamnitchi Mapping the Gnutella network: properties of large-scale peer-to-peer systems and implications for system design IEEE Internet Comput. J. 6 1 2002
    • (2002) IEEE Internet Comput. J. , vol.6 , Issue.1
    • Ripeanu, M.1    Foster, I.2    Iamnitchi, A.3
  • 20
    • 0036038685 scopus 로고    scopus 로고
    • Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility
    • Chateau Lake Louise, Banff, Canada, October
    • A. Rowstron, P. Druschel, Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility, Proc. 18th ACM Symp. on Operating Systems Principles (SOSP'01), Chateau Lake Louise, Banff, Canada, October 2001.
    • (2001) Proc. 18th ACM Symp. on Operating Systems Principles (SOSP'01)
    • Rowstron, A.1    Druschel, P.2
  • 21
    • 27244457932 scopus 로고    scopus 로고
    • Multiple power-law structures in heterogeneous complex networks
    • 020101
    • N. Sarshar, V.P. Roychowdhury, Multiple power-law structures in heterogeneous complex networks, Phys. Rev. E 72 (020101) (2005).
    • (2005) Phys. Rev. e , vol.72
    • Sarshar, N.1    Roychowdhury, V.P.2
  • 23
    • 42749108348 scopus 로고    scopus 로고
    • Scale-free and stable structures in complex ad hoc networks
    • 026101
    • N. Sarshar, and V. Roychowdhury Scale-free and stable structures in complex ad hoc networks Phys. Rev. E 69 026101 2004
    • (2004) Phys. Rev. e , vol.69
    • Sarshar, N.1    Roychowdhury, V.2
  • 25
    • 0003858844 scopus 로고    scopus 로고
    • Tapestry: An infrastructure for fault-tolerant wide-area location and routing
    • U. C. Berkeley, April
    • B.Y. Zhao, J.D. Kubiatowicz, A.D. Joseph, Tapestry: an infrastructure for fault-tolerant wide-area location and routing, Technical Report CSD-01-1141, U. C. Berkeley, April 2001.
    • (2001) Technical Report , vol.CSD-01-1141
    • Zhao, B.Y.1    Kubiatowicz, J.D.2    Joseph, A.D.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.