메뉴 건너뛰기




Volumn 37, Issue , 2004, Pages 4607-4612

Topology, search, and fault tolerance in unstructured P2P networks

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SIMULATION; COMPUTER SYSTEM RECOVERY; ERROR ANALYSIS; ITERATIVE METHODS; REDUNDANCY; USER INTERFACES;

EID: 12344256586     PISSN: 10603425     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/hicss.2004.1265682     Document Type: Conference Paper
Times cited : (19)

References (12)
  • 9
    • 0003007594 scopus 로고    scopus 로고
    • Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
    • November
    • Rowstron, A., and Druschel P., "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems", In Proc. of Middleware 2001, November 2001.
    • (2001) Proc. of Middleware 2001
    • Rowstron, A.1    Druschel, P.2
  • 12
    • 0010245386 scopus 로고    scopus 로고
    • Improving search in peer-to-peer networks
    • Stanford University, March
    • Yang, B., and Garcia-Molina, H., "Improving search in peer-to-peer networks", Technical report, Stanford University, March 2002. Available at (http://dbpubs.stanford.edu/pub/2001-47)
    • (2002) Technical Report
    • Yang, B.1    Garcia-Molina, H.2


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