Reliable file backup system over p2p architecture

Abstract

Decentralized storage systems rely on redundancy schemes and repair policies to construct a reliable solution. Various applications make use of erasure codes to provide the required redundancy level due to the fact that simple replication of objects suffers from storage inefficiency. However, one drawback of erasure codes is the large amount of bandwidth required for repairs incurred due to data loss. To counter this effect various designs have been proposed, one of them being Hierarchical Codes which we believe has got the highest potential to achieve its goals. The only drawback of this coding scheme is the complex algorithm used to determine the probability of failure. This project objective is to understand better the parameters involved in this coding scheme with the final result being a new way of structuring Hierarchical Codes which eliminate the use of such algorithm. This is achieved by anticipating the number of losses and building the Hierarchical coding schemes accordingly to completely mask temporary failures.