Journal
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
Volume 31, Issue 12, Pages 2701-2709Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JSAC.2013.131210
Keywords
Distributed storage systems; information theoretic security; repair bandwidth; regenerating codes; network coding
Funding
- TUCS
- Academy of Finland [131745]
- U.S. National Science Foundation [CCF-1016671]
- Emil Aaltonen Foundation, Finland
- Academy of Finland (AKA) [131745, 131745] Funding Source: Academy of Finland (AKA)
Ask authors/readers for more resources
The capacity of heterogeneous distributed storage systems under repair dynamics is studied. Examples of these systems include peer-to-peer storage clouds, wireless, and Internet caching systems. Nodes in a heterogeneous system can have different storage capacities and different repair bandwidths. Lower and upper bounds on the system capacity are given. These bounds depend on either the average resources per node, or on a detailed knowledge of the node characteristics. Moreover, the case in which nodes may be compromised by an adversary (passive or active) is addressed and bounds on the secure capacity of the system are derived. One implication of these new results is that symmetric repair maximizes the capacity of a homogeneous system, which justifies the model widely used in the literature.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available