A realistic distributed storage system that minimizes data storage and repair bandwidth. (arXiv:1301.1549v1 [cs.IT])

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

In a realistic distributed storage environment, storage nodes are usually
placed in racks, a metallic support designed to accommodate electronic
equipment. It is known that the communication (bandwidth) cost between nodes
within a rack is much lower than the communication (bandwidth) cost between
nodes within different racks.

In this paper, a new model, where the storage nodes are placed in two racks,
is proposed and analyzed. In this model, the storage nodes have different
repair costs to repair a node depending on the rack where they are placed. A
threshold function, which minimizes the amount of stored data per node and the
bandwidth needed to regenerate a failed node, is shown. This threshold function
generalizes the threshold function from previous distributed storage models.
The tradeoff curve obtained from this threshold function is compared with the
ones obtained from the previous models, and it is shown that this new model
outperforms the previous ones in terms of repair cost.



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