Regenerating Codes for Errors and Erasures in Distributed Storage. (arXiv:1202.1050v1 [cs.IT])

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

Regenerating codes are a class of codes proposed for efficient repair of
failed nodes in distributed storage systems. In this paper, we address the
fundamental problem of handling errors and erasures which may occur during data
reconstruction and node repair in regenerating codes. There are numerous
scenarios which motivate this problem such as time-critical data recovery,
dynamic load balancing, and security from malicious adversaries. We provide
outer bounds, and explicit regenerating codes achieving these bounds for a wide
range of system parameters. This also establishes the capacity of these systems
for these parameter regimes.

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