Results 1  10
of
583
Network Coding for Distributed Storage Systems
, 2008
"... Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peertopeer storage systems, and storage in wireless networks. Storing data using an erasure code, in fragments spread across nodes, ..."
Abstract

Cited by 331 (13 self)
 Add to MetaCart
Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peertopeer storage systems, and storage in wireless networks. Storing data using an erasure code, in fragments spread across nodes, requires less redundancy than simple replication for the same level of reliability. However, since fragments must be periodically replaced as nodes fail, a key question is how to generate encoded fragments in a distributed way while transferring as little data as possible across the network. For an erasure coded system, a common practice to repair from a node failure is for a new node to download subsets of data stored at a number of surviving nodes, reconstruct a lost coded block using the downloaded data, and store it at the new node. We show that this procedure is suboptimal. We introduce the notion of regenerating codes, which allow a new node to download functions of the stored data from the surviving nodes. We show that regenerating codes can significantly reduce the repair bandwidth. Further, we show that there is a fundamental tradeoff between storage and repair bandwidth which we theoretically characterize using flow arguments on an appropriately constructed graph. By invoking constructive results in network coding, we introduce regenerating codes that can achieve any point in this optimal tradeoff.
Coding for errors and erasures in random network coding
, 2007
"... The problem of errorcontrol in random network coding is considered. A “noncoherent” or “channel oblivious ” model is assumed where neither transmitter nor receiver is assumed to have knowledge of the channel transfer characteristic. Motivated by the property that random network coding is vectorspa ..."
Abstract

Cited by 258 (14 self)
 Add to MetaCart
The problem of errorcontrol in random network coding is considered. A “noncoherent” or “channel oblivious ” model is assumed where neither transmitter nor receiver is assumed to have knowledge of the channel transfer characteristic. Motivated by the property that random network coding is vectorspace preserving, information transmission is modelled as the injection into the network of a basis for a vector space V and the collection by the receiver of a basis for a vector space U. We introduce a metric on the space of all subspaces of a fixed vector space, and show that a minimum distance decoder for this metric achieves correct decoding if the dimension of the space V ∩ U is large enough. If the dimension of each codeword is restricted to a fixed integer, the code forms a subset of a finitefield Grassmannian. Spherepacking and spherecovering bounds as well as generalization of the Singleton bound are provided for such codes. Finally, a ReedSolomonlike code construction, related to Gabidulin’s construction of maximum rankdistance codes, is provided.
On coding for reliable communication over packet networks
, 2008
"... We consider the use of random linear network coding in lossy packet networks. In particular, we consider the following simple strategy: nodes store the packets that they receive and, whenever they have a transmission opportunity, they send out coded packets formed from random linear combinations of ..."
Abstract

Cited by 223 (37 self)
 Add to MetaCart
We consider the use of random linear network coding in lossy packet networks. In particular, we consider the following simple strategy: nodes store the packets that they receive and, whenever they have a transmission opportunity, they send out coded packets formed from random linear combinations of stored packets. In such a strategy, intermediate nodes perform additional coding yet do not decode nor wait for a block of packets before sending out coded packets. Moreover, all coding and decoding operations have polynomial complexity. We show that, provided packet headers can be used to carry an amount of sideinformation that grows arbitrarily large (but independently of payload size), random linear network coding achieves packetlevel capacity for both single unicast and single multicast connections and for both wireline and wireless networks. This result holds as long as packets received on links arrive according to processes that have average rates. Thus packet losses on links may exhibit correlations in time or with losses on other links. In the special case of Poisson traffic with i.i.d. losses, we give error exponents that quantify the rate of decay of the probability of error with coding delay. Our analysis of random linear network coding shows not only that it achieves packetlevel capacity, but also that the propagation of packets carrying “innovative ” information follows the propagation of jobs through a queueing network, thus implying that fluid flow models yield good approximations.
On Randomized Network Coding
 In Proceedings of 41st Annual Allerton Conference on Communication, Control, and Computing
, 2003
"... We consider a randomized network coding approach for multicasting from several sources over a network, in which nodes independently and randomly select linear mappings from inputs onto output links over some field. This approach was first described in [3], which gave, for acyclic delayfree netwo ..."
Abstract

Cited by 207 (39 self)
 Add to MetaCart
(Show Context)
We consider a randomized network coding approach for multicasting from several sources over a network, in which nodes independently and randomly select linear mappings from inputs onto output links over some field. This approach was first described in [3], which gave, for acyclic delayfree networks, a bound on error probability, in terms of the number of receivers and random coding output links, that decreases exponentially with code length. The proof was based on a result in [2] relating algebraic network coding to network flows. In this paper, we generalize these results to networks with cycles and delay. We also show, for any given acyclic network, a tighter bound in terms of the probability of connection feasibility in a related network problem with unreliable links. From this we obtain a success probability bound for randomized network coding in linkredundant networks with unreliable links, in terms of link failure probability and amount of redundancy.
MinimumCost Multicast over Coded Packet Networks
 IEEE TRANS. ON INF. THE
, 2006
"... We consider the problem of establishing minimumcost multicast connections over coded packet networks, i.e., packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. We consider both wireline and wireless packet networks as well as b ..."
Abstract

Cited by 166 (29 self)
 Add to MetaCart
We consider the problem of establishing minimumcost multicast connections over coded packet networks, i.e., packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. We consider both wireline and wireless packet networks as well as both static multicast (where membership of the multicast group remains constant for the duration of the connection) and dynamic multicast (where membership of the multicast group changes in time, with nodes joining and leaving the group). For static multicast, we reduce the problem to a polynomialtime solvable optimization problem, ... and we present decentralized algorithms for solving it. These algorithms, when coupled with existing decentralized schemes for constructing network codes, yield a fully decentralized approach for achieving minimumcost multicast. By contrast, establishing minimumcost static multicast connections over routed packet networks is a very difficult problem even using centralized computation, except in the special cases of unicast and broadcast connections. For dynamic multicast, we reduce the problem to a dynamic programming problem and apply the theory of dynamic programming to suggest how it may be solved.
A rankmetric approach to error control in random network coding
 IEEE Transactions on Information Theory
"... It is shown that the error control problem in random network coding can be reformulated as a generalized decoding problem for rankmetric codes. This result allows many of the tools developed for rankmetric codes to be applied to random network coding. In the generalized decoding problem induced by ..."
Abstract

Cited by 163 (11 self)
 Add to MetaCart
(Show Context)
It is shown that the error control problem in random network coding can be reformulated as a generalized decoding problem for rankmetric codes. This result allows many of the tools developed for rankmetric codes to be applied to random network coding. In the generalized decoding problem induced by random network coding, the channel may supply partial information about the error in the form of erasures (knowledge of an error location but not its value) and deviations (knowledge of an error value but not its location). For Gabidulin codes, an important family of maximum rank distance codes, an efficient decoding algorithm is proposed that can fully exploit the correction capability of the code; namely, it can correct any pattern of ǫ errors, µ erasures and δ deviations provided 2ǫ+ µ + δ ≤ d − 1, where d is the minimum rank distance of the code. Our approach is based on the coding theory for subspaces introduced by Koetter and Kschischang and can be seen as a practical way to construct codes in that context. I.
Computeandforward: Harnessing interference through structured codes
 IEEE TRANS. INF. THEORY
, 2009
"... ..."
Computation over MultipleAccess Channels
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2007
"... The problem of reliably reconstructing a function of sources over a multipleaccess channel is considered. It is shown that there is no sourcechannel separation theorem even when the individual sources are independent. Joint sourcechannel strategies are developed that are optimal when the structure ..."
Abstract

Cited by 142 (24 self)
 Add to MetaCart
The problem of reliably reconstructing a function of sources over a multipleaccess channel is considered. It is shown that there is no sourcechannel separation theorem even when the individual sources are independent. Joint sourcechannel strategies are developed that are optimal when the structure of the channel probability transition matrix and the function are appropriately matched. Even when the channel and function are mismatched, these computation codes often outperform separationbased strategies. Achievable distortions are given for the distributed refinement of the sum of Gaussian sources over a Gaussian multipleaccess channel with a joint sourcechannel lattice code. Finally, computation codes are used to determine the multicast capacity of finite field multipleaccess networks, thus linking them to network coding.
Byzantine Modification Detection in Multicast Networks using Randomized Network Coding
 IN IEEE PROC. INTL. SYM. INFORM. THEORY
, 2004
"... We show how distributed randomized network coding, a robust approach to multicasting in distributed network settings, can be extended to provide Byzantine modification detection without the use of cryptographic functions. ..."
Abstract

Cited by 118 (13 self)
 Add to MetaCart
We show how distributed randomized network coding, a robust approach to multicasting in distributed network settings, can be extended to provide Byzantine modification detection without the use of cryptographic functions.