Abstract: Embodiments of the disclosure relate to a system and method for replacing a failed node in a distributed data storage network. The network includes storage nodes storing source data amongst them in a redundant manner that is coded using one of minimum-storage, minimum-bandwidth or twin code techniques. On failure of a storage node, means of obtaining the data of the failed node from the existing nodes are described, under each of these coding techniques. This action is performed in a manner that requires a minimal amount of download. The storage space required in the nodes is also minimized.

Abstract: Embodiments of the disclosure relate to a distributed storage system comprising of storage nodes storing source data amongst them in a coded, and typically, redundant manner. The data to be stored in the storage nodes may be disseminated from the source across the network in a distributed manner. The system also includes end users who recover the source data by connecting to subsets of the storage nodes. A failed storage node may be repaired by downloading data from subsets of existing nodes. The storage space required in the nodes, and the network bandwidth utilized for repair are minimized.