Repair for Distributed Storage Systems with Erasure Channels

Download Now
Provided by: KTH - Royal Institute of Technology
Topic: Storage
Format: PDF
The authors study the repair problem of distributed storage systems in erasure networks where the packets transmitted from surviving nodes to the new node might be lost. The fundamental storage-bandwidth tradeoff is calculated by multicasting analysis in erasure networks. The optimal tradeoff bound can be asymptotically achieved when the number of transmission (packets) goes to infinity. For a limited number of transmissions, they study the probability of successful regenerating. Then, they investigate two approaches of increasing the probability of successful regenerating, namely, by connecting more surviving nodes or by increasing the storage space of nodes.
Download Now

Find By Topic