On coding for reliable communication over packet networks (0)

by D Lun, M Médard, R Koetter, M Effros
Venue:Physical Communication
Add To MetaCart
Results 1 - 10 of 218

Network coding: An instant primer

by Christina Fragouli, Jean-yves Le Boudec, Jörg Widmer - ACM SIGCOMM Computer Communication Review , 2006
"... Network coding is a new research area that may have interesting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are linear combinations of previously received information. There are two main benefits of this approach: potential throughp ..."
Abstract - Cited by 195 (7 self) - Add to MetaCart
Network coding is a new research area that may have interesting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are linear combinations of previously received information. There are two main benefits of this approach: potential throughput improvements and a high degree of robustness. Robustness translates into loss resilience and facilitates the design of simple distributed algorithms that perform well, even if decisions are based only on partial information. This paper is an instant primer on network coding: we explain what network coding does and how it does it. We also discuss the implications of theoretical results on network coding for realistic settings and show how network coding can be used in practice.
(Show Context)

Minimum-Cost Multicast over Coded Packet Networks

by Desmond S. Lun, Niranjan Ratnakar, Muriel Médard, Ralf Koetter, David R. Karger, Tracey Ho, Ebad Ahmed, Fang Zhao - IEEE TRANS. ON INF. THE , 2006
"... We consider the problem of establishing minimum-cost 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 164 (28 self) - Add to MetaCart
We consider the problem of establishing minimum-cost 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 polynomial-time 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 minimum-cost multicast. By contrast, establishing minimum-cost 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.
(Show Context)

Capacity of Wireless Erasure Networks

by Amir F. Dana, Radhika Gowaikar, Ravi Palanki, Babak Hassibi, Michelle Effros - IEEE TRANSACTIONS ON INFORMATION THEORY , 2006
"... In this paper, a special class of wireless networks, called wireless erasure networks, is considered. In these networks, each node is connected to a set of nodes by possibly correlated erasure channels. The network model incorporates the broadcast nature of the wireless environment by requiring eac ..."
Abstract - Cited by 149 (12 self) - Add to MetaCart
In this paper, a special class of wireless networks, called wireless erasure networks, is considered. In these networks, each node is connected to a set of nodes by possibly correlated erasure channels. The network model incorporates the broadcast nature of the wireless environment by requiring each node to send the same signal on all outgoing channels. However, we assume there is no interference in reception. Such models are therefore appropriate for wireless networks where all information transmission is packetized and where some mechanism for interference avoidance is already built in. This paper looks at multicast problems over these networks. The capacity under the assumption that erasure locations on all the links of the network are provided to the destinations is obtained. It turns out that the capacity region has a nice max-flow min-cut interpretation. The definition of cut-capacity in these networks incorporates the broadcast property of the wireless medium. It is further shown that linear coding at nodes in the network suffices to achieve the capacity region. Finally, the performance of different coding schemes in these networks when no side information is available to the destinations is analyzed.

Byzantine Modification Detection in Multicast Networks using Randomized Network Coding

by Tracey Ho, Ben Leong, Ralf Koetter, Muriel Medard, Michelle Effros, David R. Karger - 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.

ARQ for Network Coding

by Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard
"... Abstract—A new coding and queue management algorithm is proposed for communication networks that employ linear network coding. The algorithm has the feature that the encoding process is truly online, as opposed to a block-by-block approach. The setup assumes a packet erasure broadcast channel with s ..."
Abstract - Cited by 62 (12 self) - Add to MetaCart
Abstract—A new coding and queue management algorithm is proposed for communication networks that employ linear network coding. The algorithm has the feature that the encoding process is truly online, as opposed to a block-by-block approach. The setup assumes a packet erasure broadcast channel with stochastic arrivals and full feedback, but the proposed scheme is potentially applicable to more general lossy networks with linkby-link feedback. The algorithm guarantees that the physical queue size at the sender tracks the backlog in degrees of freedom (also called the virtual queue size). The new notion of a node “seeing ” a packet is introduced. In terms of this idea, our algorithm may be viewed as a natural extension of ARQ schemes to coded networks. Our approach, known as the drop-when-seen algorithm, is compared with a baseline queuing approach called drop-when-decoded. It is shown that the expected queue size for our approach is O ( ) (
(Show Context)

Network Coding Theory

by Raymond W. Yeung, Shuo-yen Robert Li, Ning Cai, Zhen Zhang - FOUNDATIONS AND TRENDS IN COMMUNICATIONS AND INFORMATION THEORY , 2005
"... ..."
Abstract - Cited by 58 (3 self) - Add to MetaCart
Abstract not found

Network coding for wireless applications: A brief tutorial

by Supratim Deb, Michelle Effros, Tracey Ho, David R. Karger, Ralf Koetter, Desmond S. Lun, Muriel Médard, Niranjan Ratnakar - 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
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 tree-based 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.
(Show Context)

Methods for Efficient Network Coding

by Petar Maymounkov, Nicholas J. A. Harvey - 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 capacity-achieving 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 capacity-achieving for single

Further results on coding for reliable communication over packet networks

by Desmond S. Lun, Muriel Médard, Ralf Koetter, Michelle Effros - IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT , 2005
"... ... capacity-achieving 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
... capacity-achieving 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.

Network coding for efficient wireless unicast

by Desmond S. Lun, Muriel Médard - in IEEE International Zurich Seminar on Communications , 2006
"... Abstract — We consider the problem of establishing efficient unicast connections over wireless packet networks. We show how network coding, combined with distributed flow optimization, gives a practicable approach that promises to significantly outperform the present approach of end-to-end or link-b ..."
Abstract - Cited by 53 (9 self) - Add to MetaCart
Abstract — We consider the problem of establishing efficient unicast connections over wireless packet networks. We show how network coding, combined with distributed flow optimization, gives a practicable approach that promises to significantly outperform the present approach of end-to-end or link-bylink retransmission combined with route optimization, where performance may be measured in terms of energy consumption, congestion, or any other cost that increases with the number of transmissions made by each node. We present a specific coding scheme and specific distributed flow optimization techniques that may be used to form the basis of a protocol. I.
(Show Context)