메뉴 건너뛰기




Volumn , Issue , 2004, Pages 72-79

PeerStore: Better performance by relaxing in peer-to-peer backup

Author keywords

[No Author keywords available]

Indexed keywords

BACKUP; DISTRIBUTED HASH TABLES (DHT); METADATA MANAGEMENT; PEER TO PEER NETWORKS;

EID: 13244289956     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PTP.2004.1334933     Document Type: Conference Paper
Times cited : (44)

References (13)
  • 1
    • 4544387814 scopus 로고    scopus 로고
    • pStore: A secure peer-to-peer backup system
    • MIT Laboratory for Computer Science, December
    • C. Batten, K. Barr, A. Saraf, and S. Treptin. pStore: A secure peer-to-peer backup system. Technical Memo MIT-LCS-TM-632, MIT Laboratory for Computer Science, December 2001.
    • (2001) Technical Memo , vol.MIT-LCS-TM-632
    • Batten, C.1    Barr, K.2    Saraf, A.3    Treptin, S.4
  • 10
    • 0003676885 scopus 로고
    • Fingerprinting by random polynomials
    • Harvard Aiken Computer Laboratory
    • Michael O. Rabin. Fingerprinting by random polynomials. Technical Report TR-15-18, Harvard Aiken Computer Laboratory, 1981.
    • (1981) Technical Report , vol.TR-15-18
    • Rabin, M.O.1
  • 11
    • 57349142855 scopus 로고    scopus 로고
    • Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems
    • Antony Rowstron and Peter Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science, 2218:329-350, 2001.
    • (2001) Lecture Notes in Computer Science , vol.2218 , pp. 329-350
    • Rowstron, A.1    Druschel, P.2


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