메뉴 건너뛰기




Volumn , Issue , 2009, Pages 376-384

A practical study of regenerating codes for peer-to-peer backup systems

Author keywords

[No Author keywords available]

Indexed keywords

ATTRACTIVE SOLUTIONS; BACK-UP SYSTEMS; COMMUNICATION EFFICIENCY; COMMUNICATION OVERHEADS; COMPUTATIONAL COSTS; DISTRIBUTED STORAGE SYSTEM; ERASURE CODES; ERASURE CODING; PARAMETER VALUES; PEER TO PEER; STORAGE COSTS; STORAGE EFFICIENCY; STORAGE NODES; STORAGE OVERHEAD; STORAGE SPACES;

EID: 70350241664     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2009.14     Document Type: Conference Paper
Times cited : (62)

References (13)
  • 2
    • 0038217931 scopus 로고    scopus 로고
    • Wide-area cooperative storage with CFS
    • F. Dabek et al., "Wide-area cooperative storage with CFS," in SOSP, 2001.
    • (2001) SOSP
    • Dabek, F.1
  • 3
    • 85001706405 scopus 로고    scopus 로고
    • Glacier: Highly durable, decentralized storage despite massive correlated failures
    • A. Haeberlen, A. Mislove, and P. Druschel, "Glacier: Highly durable, decentralized storage despite massive correlated failures," in NSDI, 2005.
    • (2005) NSDI
    • Haeberlen, A.1    Mislove, A.2    Druschel, P.3
  • 4
    • 34548032503 scopus 로고    scopus 로고
    • Design and evaluation of distributedwide-area on-line archival storage systems,
    • Ph.D. dissertation, University of California, Berkeley
    • H. Weatherspoon, "Design and evaluation of distributedwide-area on-line archival storage systems," Ph.D. dissertation, University of California, Berkeley, 2006.
    • (2006)
    • Weatherspoon, H.1
  • 5
    • 33847273869 scopus 로고    scopus 로고
    • High availability in DHTs: Erasure coding vs.replication
    • R. Rodrigues and B. Liskov, "High availability in DHTs: Erasure coding vs.replication," in IPTPS, 2005.
    • (2005) IPTPS
    • Rodrigues, R.1    Liskov, B.2
  • 6
    • 18344385312 scopus 로고    scopus 로고
    • Erasure coding vs. replication: A quantitative comparison
    • H. Weatherspoon and J. D. Kubiatowicz, "Erasure coding vs. replication: A quantitative comparison," in IPTPS, 2002.
    • (2002) IPTPS
    • Weatherspoon, H.1    Kubiatowicz, J.D.2
  • 7
    • 70350223306 scopus 로고    scopus 로고
    • A. G. Dimakis, B. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, Network coding for distributed storage systems, Computer Research Repository (CoRR), arXiv:0803.0632v1 http://arxiv.org/abs/0803.0632, Mar. 2008.
    • A. G. Dimakis, B. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," Computer Research Repository (CoRR), vol. arXiv:0803.0632v1 http://arxiv.org/abs/0803.0632, Mar. 2008.
  • 8
    • 70350220222 scopus 로고    scopus 로고
    • Hierarchical codes: How to make erasure codes attractive for peer-to-peer storage systems
    • A. Duminuco and E. Biersack, "Hierarchical codes: How to make erasure codes attractive for peer-to-peer storage systems," in IEEE P2P, 2008.
    • (2008) IEEE
    • Duminuco, A.1    Biersack, E.2
  • 10
    • 0031223146 scopus 로고    scopus 로고
    • A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems
    • September
    • J. S. Plank, "A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems," Software - Practice & Experience, vol. 27, no. 9, pp. 995-1012, September 1997.
    • (1997) Software - Practice & Experience , vol.27 , Issue.9 , pp. 995-1012
    • Plank, J.S.1
  • 11
    • 33745140230 scopus 로고    scopus 로고
    • How good is random linear coding based distributed networked storage?
    • S. Acedacnski, S. Deb, M. Medard, and R. Koetter, "How good is random linear coding based distributed networked storage?" in NETCOD, 2005.
    • (2005) NETCOD
    • Acedacnski, S.1    Deb, S.2    Medard, M.3    Koetter, R.4


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