In distributed storage systems that use coding, the issue of minimizing the communication required to rebuild a storage node after a failure arises. We consider the problem of repa...
Zhiying Wang, Alexandros G. Dimakis, Jehoshua Bruc...
In this paper we present a quantitative study of data survival in peer to peer storage systems. We first recall two main redundancy mechanisms: replication and erasure codes, whic...
This paper studies the use of highly dynamic networks as infrastructures for persistent storage of data that offer services at specific geographical zones in a decentralized and...
–This paper addresses the efficient multicast dissemination of bulk data from a single server to numerous clients. The challenge is complex: a client may commence reception at ar...
Distributed storage systems employ replicas or erasure code to ensure high reliability and availability of data. Such replicas create great amount of network traffic that negative...