Linear network coding
Ning Cai2000, IEEE Transactions on Information Theory
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
Consider a communication network in which certain source nodes multicast information to other nodes on the network in the multihop fashion where every node can pass on any of its received data to others. We are interested in how fast each node can receive the complete information, or equivalently, what the information rate arriving at each node is. Allowing a node to encode its received data before passing it on, the question involves optimization of the multicast mechanisms at the nodes. Among the simplest coding schemes is linear coding, which regards a block of data as a vector over a certain base field and allows a node to apply a linear transformation to a vector before passing it on. We formulate this multicast problem and prove that linear coding suffices to achieve the optimum, which is the max-flow from the source to each receiving node.
Figures (4)
Related papers
Optimal Multicast Control for Simple Network Coding
IEEE Transactions on Vehicular Technology, 2015
We propose a network coding strategy for multicast applications called the simple network coding scheme, which takes network coding chances raised among adjacent nodes. The proposed scheme incorporates both intrasession and intersession network coding strategies and effectively improves multicast throughput. We characterize the capacity region of the proposed scheme and derive an optimal control algorithm for the proposed scheme. We perform a complexity analysis for the proposed control algorithm and provide some insights into its practical implementation. For a comparison, we also formulate the capacity region of conventional multicast schemes and provide performance evaluation using a linear programming solver. In empirical analyses, we investigate how the proposed scheme improves multicast throughput gains from various perspectives (i.e., the number of flows, the number of network coded packets, and split-multicast) and find out that most of the gains can be achieved by simple pairwise network coding with non-split-multicast. We observe dramatic throughput gains up to 75% beyond the conventional schemes on random topologies with ten nodes.
Multi-rate Multicasting with Network Coding
Proceedings of the 4th International ICST Conference on Wireless Internet, 2008
Multicasting is the delivery of common information to multiple receivers. It finds its application in multi-media broadcasts, group communication in social networks etc. The multicast traffic in networks can constitute a significant portion of the total traffic (e.g. 80% in military communications) and hence it is imperative that they are served efficiently. So far "single rate" multicasting, where all receivers receive the data at a common rate from the source has attracted most of the attention . Yet, single-rate multicasting may yield low utilization of the network resources when a subset of the receivers creates a bottleneck for the whole multicast group. Multirate multicasting is a strategy where the source is allowed to multicast its data to different destinations at different rates based on the condition of the network to them. Multirate multicasting allows users with better channels to achieve maximum performance.
Optimal distributed multicast routing using network coding
2007
Abstract Multicast is an important communication paradigm, also a problem well known for its difficulty (NP-completeness) to achieve certain optimization goals, such as minimum network delay. Recent advances in network coding has shed a new light onto this problem. In network coding, forwarding nodes can perform arbitrary operations on data received, other than forwarding or replicating, to enhance throughput of a multicast session.
On the capacity improvement of multicast traffic with network coding
2008
In this paper, we study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks when nodes are endowed with multipacket transmission (MPT) and multi-packet reception (MPR) capabilities. We show that a per session throughput capacity of Θ`nT 3 (n)´, where n is the total number of nodes and T (n) is the communication range, can be achieved as a tight bound when each session contains a constant number of sinks. Surprisingly, an identical order capacity can be achieved when nodes have only MPR and MPT capabilities. This result proves that NC does not contribute to the order capacity of multicast traffic in wireless ad hoc networks when MPR and MPT are used in the network. The result is in sharp contrast to the general belief (conjecture) that NC improves the order capacity of multicast. Furthermore, if the communication range is selected to guarantee the connectivity in the network, i.e., T (n) ≥ Θ " p log n/n " , then the combination of MPR and MPT achieves a throughput capacity of Θ " log 3 2 n √ n « which provides an order capacity gain of Θ`log 2 n´compared to the point-to-point multicast capacity with the same number of destinations.
Implementation of Distributed Algorithm with Network Coding for Multicast Network
2012
In today's practical networks, end-to-end information delivery is performed by routing. Network coding generalizes routing by allowing a node to generate output data by mixing (i.e., computing certain functions of) its received data. Network coding techniques are used to find the minimum cost in given network. In wire line network, solving for the optimal coding subgraphs in network coding is equivalent to finding the optimal routing scheme in a multi-commodity flow problem. Multicast is an important factor for the communication in wireless network. This problem is also known as NP-complete. This paper focuses on the solution for the above problem and provides the analytical framework as well as distributed algorithm in multicast session. A set of node based distributed algorithm are designed at sources node and virtual at intermediate node. Keyword-Network coding, multi-commodity flow problem, distributed algorithm, wireless networks.
Network Coding in a Multicast Switch
2007
The problem of serving multicast flows in a crossbar switch is considered. Intra-flow linear network coding is shown to achieve a larger rate region than the case without coding. A traffic pattern is presented which is achievable with coding but requires a switch speedup when coding is not allowed. The rate region with coding can be characterized in a simple graph-theoretic manner, in terms of the stable set polytope of the "enhanced conflict graph". No such graph-theoretic characterization is known for the case of fanout splitting without coding.
The encoding complexity of network coding with two simple multicast sessions
2012 9th International Conference on Fuzzy Systems and Knowledge Discovery, 2012
The encoding complexity of network coding for single multicast networks has been intensively studied from several aspects: e.g., the time complexity, the required number of encoding links, and the required field size for a linear code solution. However, these issues as well as the solvability are less understood for networks with multiple multicast sessions. Recently, Wang and Shroff showed that the solvability of networks with two unit-rate multicast sessions (2-URMS) can be decided in polynomial time . In this paper, we prove that for the 2-URMS networks: 1) the solvability can be determined with time O(|E|); 2) a solution can be constructed with time O(|E|); 3) an optimal solution can be obtained in polynomial time; 4) the number of encoding links required to achieve a solution is upper-bounded by max{3, 2N -2}; and 5) the field size required to achieve a linear solution is upper-bounded by max{2, ⌊ 2N -7/4 + 1/2⌋}, where |E| is the number of links and N is the number of sinks of the underlying network. Both bounds are shown to be tight.
Polynomial time algorithms for multicast network code construction
IEEE Transactions on Information Theory, 2005
The famous max-flow min-cut theorem states that a source node can send information through a network ( ) to a sink node at a rate determined by the min-cut separating and . Recently, it has been shown that this rate can also be achieved for multicasting to several sinks provided that the intermediate nodes are allowed to re-encode the information they receive. We demonstrate examples of networks where the achievable rates obtained by coding at intermediate nodes are arbitrarily larger than if coding is not allowed. We give deterministic polynomial time algorithms and even faster randomized algorithms for designing linear codes for directed acyclic graphs with edges of unit capacity. We extend these algorithms to integer capacities and to codes that are tolerant to edge failures.
Fundamental limits on end-to-end throughput of network coding in multi-rate and multicast wireless networks
Computer Networks, 2013
This paper investigates the interaction between network coding and link-layer transmission rate diversity in multi-hop wireless networks. By appropriately mixing data packets at intermediate nodes, network coding allows a single multicast flow to achieve higher throughput to a set of receivers. Broadcast applications can also exploit link-layer rate diversity, whereby individual nodes can transmit at faster rates at the expense of corresponding smaller coverage area. We first demonstrate how combining rate-diversity with network coding can provide a larger capacity for data dissemination of a single multicast flow, and how consideration of rate diversity is critical for maximizing system throughput. Next we address the following question: given a specific topology of wireless nodes, what is the maximum rate that can be supported by the resultant network exploiting both network coding and multi-rate? We present a linear programming model to compute the maximal throughput that a multicast application can achieve with network coding in a rate-diverse wireless network. We also present analytical results where we observe noticeably better throughput than traditional routing. This suggests there is opportunity for achieving higher throughput by combining network coding and multi-rate diversity.
Related papers
Network Coding in Minimal Multicast Networks
2006 IEEE Information Theory Workshop, 2006
We investigate the network coding problem in a certain class of minimal multicast networks. In a multicast coding network, a source S needs to deliver h symbols, or packets, to a set of destinations T over an underlying communication network modeled by a graph G. A coding network is said to be h-minimal if it can deliver h symbols from S to the destination nodes, while any proper subnetwork of G can deliver at most h − 1 symbols to the set of destination nodes. This problem is motivated by the requirement to minimize the amount of network resources allocated for a multicast connections.
Optimality of Network Coding in Packet Networks
2011
We resolve the question of optimality for a wellstudied packetized implementation of random linear network coding, called PNC. In PNC, in contrast to the classical memoryless setting, nodes store received information in memory to later produce coded packets that reflect this information. PNC is known to achieve order optimal stopping times for the manyto-all multicast problem in many settings.
A Linear Inter-Session Network Coding Scheme for Multicast
Journal of Communications, 2009
Network coding is a promising generalization of routing which allows a network node to generate output messages by encoding its received messages to reduce the bandwidth consumption in the network. An important application where network coding offers unique advantages is the multicast network where a source node generates messages and multiple receivers collect the messages. Previous network coding schemes primarily considered encoding the messages in a single multicast session. In this paper, we consider the linear inter-session network coding for multicast. The basic idea is to divide the sessions into different groups and construct a linear network coding scheme for each group. To maximize the performance, we introduce two metrics: overlap ratio and overlap width, to measure the benefit that a system can achieve by inter-session network coding. The overlap ratio mainly characterizes the network bandwidth while the overlap width characterizes the system throughput. Our simulation results show that the proposed inter-session network coding scheme can achieve about ¿¼± higher throughput than intra-session network coding.
Bounds on linear codes for network multicast
Electronic Colloquium on …, 2003
Traditionally, communication networks are composed of routing nodes, which relay and duplicate data. Work in recent years has shown that for the case of multicast, an improvement in both rate and code-construction complexity can be gained by replacing these routing nodes by linear coding nodes. These nodes transmit linear combinations of the inputs transmitted to them.
Optimal distributed multicast routing using network coding: Theory and applications
2004
Abstract Optimal data routing in a network can be often understood as a multicommodity flow problem. Given a network and a set of commodities, ie, a set of source-destination pairs, one tries to achieve certain optimization goal, such as minimum delay, maximum throughput, while maintaining certain fairness among all commodities. The constraints of such optimization problems are usually network link capacity and traffic demand of each commodity.
On Random Network Coding for Multicast
Computing Research Repository, 2007
Random linear network coding is a particularly decentralized approach to the multicast problem. Use of random network codes introduces a non-zero probability however that some sinks will not be able to successfully decode the required sources. One of the main theoretical motivations for random network codes stems from the lower bound on the probability of successful decoding reported by Ho et. al. (2003). This result demonstrates that all sinks in a linearly solvable network can successfully decode all sources provided that the random code field size is large enough. This paper develops a new bound on the probability of successful decoding.
Minimum-cost Subgraph Algorithms for Static and Dynamic Multicasts with Network Coding
New Directions in Wireless Communications Research, 2009
Network coding, introduced by Ahlswede et al. in their pioneering work [1], has generated considerable research interest in recent years, and numerous subsequent papers, e.g., , have built upon this concept. One of the main advantages of network coding over traditional routed networks is in the area of multicast, where common information is transmitted from a source node to a set of terminal nodes. Ahlswede et al. showed in [1] that network coding can achieve the maximum multicast rate, which is not achievable by routing alone. When coding is used to perform multicast, the problem of establishing minimum cost multicast connection is equivalent to two effectively decoupled problems: one of determining the subgraph to code over and the other of determining the code to use over that subgraph. The latter problem has been studied extensively in , and a variety of methods have been proposed, which include employing simple random linear coding at every node. Such random linear coding schemes are completely decentralized, requiring no coordination between nodes, and can operate under dynamic conditions . These papers, however, all assume the availability of dedicated network resources.
The Complexity of Network Coding With Two Unit-Rate Multicast Sessions
IEEE Transactions on Information Theory, 2013
The encoding complexity of network coding for single multicast networks has been intensively studied from several aspects: e.g., the time complexity, the required number of encoding links, and the required field size for a linear code solution. However, these issues as well as the solvability are less understood for networks with multiple multicast sessions. Recently, Wang and Shroff showed that the solvability of networks with two unit-rate multicast sessions (2-URMS) can be decided in polynomial time [4]. In this paper, we prove that for the 2-URMS networks: 1) the solvability can be determined with time O(|E|); 2) a solution can be constructed with time O(|E|); 3) an optimal solution can be obtained in polynomial time; 4) the number of encoding links required to achieve a solution is upper-bounded by max{3, 2N − 2}; and 5) the field size required to achieve a linear solution is upper-bounded by max{2, ⌊ 2N − 7/4 + 1/2⌋}, where |E| is the number of links and N is the number of sinks of the underlying network. Both bounds are shown to be tight.
Network coding: a computational perspective
2009
In this work, we study the computational perspective of network coding, focusing on two issues. First, we address the computational complexity of finding a network code for acyclic multicast networks. Second, we address the issue of reducing the amount of computation performed by network nodes. In particular, we consider the problem of finding a network code with the minimum possible number of encoding nodes, i.e., nodes that generate new packets by performing algebraic operations on packets received over incoming links.
Network Coding for Multi-Resolution Multicast
2009
Multi-resolution codes enable multicast at different rates to different receivers, a setup that is often desirable for graphics or video streaming. We propose a simple, distributed, two-stage message passing algorithm to generate network codes for single-source multicast of multi-resolution codes. The goal of this pushback algorithm is to maximize the total rate achieved by all receivers, while guaranteeing decodability of the base layer at each receiver. By conducting pushback and code assignment stages, this algorithm takes advantage of inter-layer as well as intra-layer coding. Numerical simulations show that in terms of total rate achieved, the pushback algorithm outperforms routing and intra-layer coding schemes, even with field sizes as small as 2 10 (10 bits). In addition, the performance gap widens as the number of receivers and the number of nodes in the network increases. We also observe that naïve inter-layer coding schemes may perform worse than intra-layer schemes under certain network conditions.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.