Abstract
Distributed storage systems aim at providing a reliable storage over unreliable nodes thorough introducing redundancy. In these systems when a node is failed to retain the previous reliability a newcomer is connected to existing nodes and downloads the same amount of information as the damage node. Thus, a great deal of data transferring, called the repair bandwidth, is imposed to the system. Recently, regenerating codes are introduced to reduce the repair bandwidth through using the notion of network coding. Furthermore, in the generalized regenerating codes are proposed which is an extension of regenerating codes for the case of having different download cost from surviving nodes. The current paper provides a real world example to explain the main difference between regenerating codes and generalized regenerating codes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
