메뉴 건너뛰기




Volumn , Issue , 2006, Pages 413-421

Providing high reliability in a minimum redundancy archival storage system

Author keywords

[No Author keywords available]

Indexed keywords

ARCHIVAL STORAGE SYSTEMS; COMPRESSION METHODS; COMPRESSION TECHNIQUES; CONVENTIONAL APPROACH; HIGH RELIABILITY; REPLICATION LEVEL; STORAGE SPACES; STORAGE SYSTEMS;

EID: 83155172040     PISSN: 15267539     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (72)

References (36)
  • 7
    • 57349147832 scopus 로고    scopus 로고
    • Data Domain. http://www.datadomain.com.
    • Data Domain
  • 19
    • 0003629991 scopus 로고
    • NIST. FIPS 180-1, Apr
    • NIST. Secure hash standard. FIPS 180-1, Apr. 1995.
    • (1995) Secure Hash Standard
  • 20
    • 0003629990 scopus 로고    scopus 로고
    • NIST. FIPS 180-2, Aug
    • NIST. Secure hash standard. FIPS 180-2, Aug. 2002.
    • (2002) Secure Hash Standard
  • 21
  • 22
    • 0031223146 scopus 로고    scopus 로고
    • A tutorial on reed-Solomon coding for faulttolerance in RAID-like systems
    • Sept.
    • J. S. Plank. A tutorial on Reed-Solomon coding for faulttolerance in RAID-like systems. Software-Practice and Experience (SPE), 27(9):995-1012, Sept. 1997.
    • (1997) Software-Practice and Experience (SPE) , vol.27 , Issue.9 , pp. 995-1012
    • Plank, J.S.1
  • 26
    • 0003195066 scopus 로고
    • The MD5 message-digest algorithm
    • IETF, Apr
    • R. Rivest. The MD5 message-digest algorithm. Request For Comments (RFC) 1321, IETF, Apr. 1992.
    • (1992) Request for Comments (RFC) , vol.1321
    • Rivest, R.1
  • 36
    • 0017493286 scopus 로고
    • A universal algorithm for sequential data compression
    • J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23(3):337-343, 1977.
    • (1977) IEEE Transactions on Information Theory , vol.23 , Issue.3 , pp. 337-343
    • Ziv, J.1    Lempel, A.2


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