메뉴 건너뛰기




Volumn , Issue , 2012, Pages 2498-2506

Exact regenerating codes for Byzantine fault tolerance in distributed storage

Author keywords

Byzantine failures; Error detection code; Network storage; Reed Solomon code; Regenerating code

Indexed keywords

BYZANTINE FAILURES; BYZANTINE FAULT TOLERANCE; COMMODITY SOFTWARE; CRASH-STOP FAILURES; DATA RECONSTRUCTION; DISTRIBUTED STORAGE; ERROR-DETECTION CODE; FAILED NODES; INTEGRITY CHECK; LARGE-SCALE DISTRIBUTED STORAGE; MULTIPLE NODES; NETWORK STORAGE; PROGRESSIVE DECODING; REGENERATING CODE; SECURITY PROPERTIES;

EID: 84861610078     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2012.6195641     Document Type: Conference Paper
Times cited : (30)

References (20)
  • 4
    • 79951955602 scopus 로고    scopus 로고
    • Existence and construction of capacity-achieving network codes for distributed storage
    • February
    • Y. Wu, "Existence and construction of capacity-achieving network codes for distributed storage," IEEE Journal on Selected Areas in Communications, vol. 28, pp. 277-288, February 2010.
    • (2010) IEEE Journal on Selected Areas in Communications , vol.28 , pp. 277-288
    • Wu, Y.1
  • 10
    • 79961002025 scopus 로고    scopus 로고
    • Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction
    • August
    • K. V. Rashmi, N. B. Shah, and P. V. Kumar, "Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction," IEEE Trans. Inform. Theory, vol. 57, pp. 5227-5239, August 2011.
    • (2011) IEEE Trans. Inform. Theory , vol.57 , pp. 5227-5239
    • Rashmi, K.V.1    Shah, N.B.2    Kumar, P.V.3
  • 11


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