Results 1  10
of
164
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 217 (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.
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 (12 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.
Network coding for multiple unicasts: An approach based on linear optimization
 IEEE INT. SYMP. INF. THEORY
, 2006
"... In this paper we consider the application of network coding to a multiple unicast setup. We present two suboptimal, yet practical code construction techniques. One consists of a linear program and the other of an integer program with fewer variables and constraints. We discuss the performance of th ..."
Abstract

Cited by 69 (8 self)
 Add to MetaCart
(Show Context)
In this paper we consider the application of network coding to a multiple unicast setup. We present two suboptimal, yet practical code construction techniques. One consists of a linear program and the other of an integer program with fewer variables and constraints. We discuss the performance of the proposed techniques as well as their complexity.
Alternative Distributed Algorithms for Network Utility Maximization: Framework and Applications
 IEEE Transactions on Automatic Control
, 2007
"... Abstract—Network utility maximization (NUM) problem formulations provide an important approach to conduct network resource allocation and to view layering as optimization decomposition. In the existing literature, distributed implementations are typically achieved by means of the socalled dual deco ..."
Abstract

Cited by 59 (7 self)
 Add to MetaCart
(Show Context)
Abstract—Network utility maximization (NUM) problem formulations provide an important approach to conduct network resource allocation and to view layering as optimization decomposition. In the existing literature, distributed implementations are typically achieved by means of the socalled dual decomposition technique. However, the span of decomposition possibilities includes many other elements that, thus far, have not been fully exploited, such as the use of the primal decomposition technique, the versatile introduction of auxiliary variables, and the potential of multilevel decompositions. This paper presents a systematic framework to exploit alternative decomposition structures as a way to obtain different distributed algorithms, each with a different tradeoff among convergence speed, message passing amount and asymmetry, and distributed computation architecture. Several specific applications are considered to illustrate the proposed framework, including resourceconstrained and directcontrol rate allocation, and rate allocation among QoS classes with multipath routing. For each of these applications, the associated generalized NUM formulation is first presented, followed by the development of novel alternative decompositions and numerical experiments on the resulting new distributed algorithms. A systematic enumeration and comparison of alternative vertical decompositions in the future will help complete a mathematical theory of network architectures. Index Terms—Congestion control, distributed algorithm, mathematical programming/optimization, network control by pricing, network utility maximization (NUM), rate control, resource allocation.
Network coding for wireless applications: A brief tutorial
 In IWWAN
, 2005
"... Abstract — The advent of network coding promises to change many aspects of networking. Network coding moves away from the classical approach of networking, which treats networks as akin to physical transportation systems. We overview some of the main features of network coding that are most relevant ..."
Abstract

Cited by 57 (6 self)
 Add to MetaCart
(Show Context)
Abstract — The advent of network coding promises to change many aspects of networking. Network coding moves away from the classical approach of networking, which treats networks as akin to physical transportation systems. We overview some of the main features of network coding that are most relevant to wireless networks. In particular, we discuss the fact that random distributed network coding is asymptotically optimal for wireless networks with and without packet erasures. These results are extremely general and allow packet loss correlation, such as may occur in fading wireless channels. The coded network lends itself, for multicast connections, to a cost optimization which not only outperforms traditional routing treebased approaches, but also lends itself to a distributed implementation and to a dynamic implementation when changing conditions, such as mobility, arise. We illustrate the performance of such optimization methods for energy efficiency in wireless networks and propose some new directions for research in the area. I.
Methods for Efficient Network Coding
 In Allerton
, 2006
"... Random linear network coding is a multicast communication scheme in which all participating nodes send out coded packets formed from random linear combinations of packets received so far. This scheme is capacityachieving for single ..."
Abstract

Cited by 56 (2 self)
 Add to MetaCart
Random linear network coding is a multicast communication scheme in which all participating nodes send out coded packets formed from random linear combinations of packets received so far. This scheme is capacityachieving for single
Further results on coding for reliable communication over packet networks
 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT
, 2005
"... ... capacityachieving coding scheme for unicast or multicast over lossy wireline or wireless packet networks is presented. We extend that paper’s results in two ways: First, we extend the network model to allow packets received on a link to arrive according to any process with an average rate, as o ..."
Abstract

Cited by 55 (11 self)
 Add to MetaCart
... capacityachieving coding scheme for unicast or multicast over lossy wireline or wireless packet networks is presented. We extend that paper’s results in two ways: First, we extend the network model to allow packets received on a link to arrive according to any process with an average rate, as opposed to the assumption of Poisson traffic with i.i.d. losses that was previously made. Second, in the case of Poisson traffic with i.i.d. losses, we derive error exponents that quantify the rate at which the probability of error decays with coding delay.
Reliable physical layer network coding
 PROCEEDINGS OF THE IEEE
, 2011
"... When two or more users in a wireless network transmit simultaneously, their electromagnetic signals are linearly superimposed on the channel. As a result, a receiver that is interested in one of these signals sees the others as unwanted interference. This property of the wireless medium is typicall ..."
Abstract

Cited by 54 (5 self)
 Add to MetaCart
When two or more users in a wireless network transmit simultaneously, their electromagnetic signals are linearly superimposed on the channel. As a result, a receiver that is interested in one of these signals sees the others as unwanted interference. This property of the wireless medium is typically viewed as a hindrance to reliable communication over a network. However, using a recently developed coding strategy, interference can in fact be harnessed for network coding. In a wired network, (linear) network coding refers to each intermediate node taking its received packets, computing a linear combination over a finite field, and forwarding the outcome towards the destinations. Then, given an appropriate set of linear combinations, a destination can solve for its desired packets. For certain topologies, this strategy can attain significantly higher throughputs over routingbased strategies. Reliable physical layer network coding takes this idea one step further: using judiciously chosen linear errorcorrecting codes, intermediate nodes in a wireless network can directly recover linear combinations of the packets from the observed noisy superpositions of transmitted signals. Starting with some simple examples, this survey explores the core ideas behind this new technique and the possibilities it offers for communication over interferencelimited wireless networks.
Optimization Based Rate Control for Multicast with Network Coding
 Proc. IEEE Infocom
, 2007
"... Abstract — Recent advances in network coding have shown great potential for efficient information multicasting in communication networks, in terms of both network throughput and network management. In this paper, we address the problem of rate control at endsystems for network coding based multicas ..."
Abstract

Cited by 51 (4 self)
 Add to MetaCart
(Show Context)
Abstract — Recent advances in network coding have shown great potential for efficient information multicasting in communication networks, in terms of both network throughput and network management. In this paper, we address the problem of rate control at endsystems for network coding based multicast flows. We develop two adaptive rate control algorithms for the networks with given coding subgraphs and without given coding subgraphs, respectively. With random network coding, both algorithms can be implemented in a distributed manner, and work at transport layer to adjust source rates and at network layer to carry out network coding. We prove that the proposed algorithms converge to the globally optimal solutions for intrasession network coding. Some related issues are discussed, and numerical examples are provided to complement our theoretical analysis.