Repair for Distributed Storage Systems with Erasure Channels. (arXiv:1301.7054v1 [cs.IT])

from cs.IT updates on arXiv.org http://arxiv.org/abs/1301.7054

We 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 transmission, we study the probability of
successful regenerating. Then, we investigate two approaches of increasing the
probability of successful regenerating, namely, by connecting more surviving
nodes or by increasing the storage space of nodes. Using more nodes may pose
larger delay and in certain situation it might not be possible to connect to
more nodes too. We show that in addition to reducing repair bandwidth,
increasing storage space can also increase reliability for repair.

Advertisements

发表评论

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / 更改 )

Twitter picture

You are commenting using your Twitter account. Log Out / 更改 )

Facebook photo

You are commenting using your Facebook account. Log Out / 更改 )

Google+ photo

You are commenting using your Google+ account. Log Out / 更改 )

Connecting to %s