Referenced Items are not available for this document.
Recently, regenerating codes, a special network coding technique, were discovered for fault-tolerant storage systems with the promising advantage of efficient data recovery in the case of a single node failure and replacement (regeneration case). From the perspective of coding theory, regenerating codes are extensively studied, but there exists no reference on how to implement these codes in storage systems. We provide a comparison of Reed-Solomon codes and regenerating codes from an implementation point of view. The comparison includes the experimental evaluation of the encoding and the regeneration data throughput.
Published in:
Network Computing and Applications (NCA), 2012 11th IEEE International Symposium on
Date of Conference: 23-25 Aug. 2012
- Page(s):
- 67 - 70
- Print ISBN:
- 978-1-4673-2214-0
- INSPEC Accession Number:
- 12983495
- Conference Location :
- Cambridge, MA
- Digital Object Identifier :
- 10.1109/NCA.2012.35
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
