Randomized algorithms
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Maintenance-Free Global Data Storage
IEEE Internet Computing
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Information Theory and Network Coding
Information Theory and Network Coding
Network Coding Fundamentals
Reducing repair traffic for erasure coding-based storage via interference alignment
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Existence and construction of capacity-achieving network codes for distributed storage
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Network Coding: An Introduction
Network Coding: An Introduction
IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction
IEEE Transactions on Information Theory
| Hi-index | 0.07 |
In a distributed storage system based on erasure coding, when a storage node fails, repairing the erasure code incurs some network traffic. Previous work has characterized the fundamental tradeoff between storage efficiency and repair network bandwidth. This was done via a cut-based analysis on a graph that models the evolution of information flow in the storage system subject to arbitrary sequences of node failures/repairs. This paper presents techniques for constructing network codes that achieve the optimal tradeoff between storage efficiency and repair network bandwidth. The challenge here is that network coding is applied over an unbounded graph with an unbounded number of receivers. It is shown in this paper that optimal codes can be constructed over a finite field whose size depends only on the maximum number of nodes at any instant, but independent of how many failures/repairs can happen. Key to the code construction is a "path-weaving" procedure that leads to inductive existence proof and code construction.