Rateless erasure resilient codes for content storage and distribution in P2P networks

In this paper, we investigate the performance of rateless erasure resilient codes for distributed file storage in P2P networks. While the key distinctive feature of the proposed codes is the scalability to an arbitrary number of peers in the P2P network, it will be shown that the proposed rateless erasure resilient codes also offer great improvement in increase in bandwidth and reliability of data retrieval compared to other erasure resilient coding schemes.