On the hardness of approximating the network coding capacity
Alex Sprintson2008
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
This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of the given instance when restricted to linear encoding functions. It has been shown [Lehman and Lehman, SODA 2005] that determining the (scalar) linear capacity of a general network coding instance is NP-hard. In this work we initiate the study of approximation in this context. Namely, we show that given an instance to the general network coding problem of linear capacity C, constructing a linear code of rate alphaC for any universal (i.e., independent of the size of the instance) constant alphales1 is ldquohardrdquo. Specifically, finding such network codes would solve a long standing open problem in the field of graph coloring. In addition, we consider the problem of determining the (scalar) linear capacity of a planar network coding instance (i.e., a general instance in which the underlying graph is planar). We show that even for planar networks this problem remains NP-hard.
Related papers
Network coding as a coloring problem
2004
We consider a multicast configuration with two sources, and translate the network code design problem to vertex coloring of an appropriately defined graph. This observation enables to derive code design algorithms and alphabet size bounds, as well as establish a connection with a number of well-known results from discrete mathematics that increase our insight in the different trade-offs possible for network coding.
The encoding complexity of network coding
2006
In the multicast network coding problem, a source needs to deliver packets to a set of terminals over an underlying communication network . The nodes of the multicast network can be broadly categorized into two groups. The first group incudes encoding nodes, i.e., nodes that generate new packets by combining data received from two or more incoming links. The second group includes forwarding nodes that can only duplicate and forward the incoming packets. Encoding nodes are, in general, more expensive due to the need to equip them with encoding capabilities. In addition, encoding nodes incur delay and increase the overall complexity of the network. Accordingly, in this paper, we study the design of multicast coding networks with a limited number of encoding nodes. We prove that in a directed acyclic coding network, the number of encoding nodes required to achieve the capacity of the network is bounded by 3 2 . Namely, we present (efficiently constructible) network codes that achieve capacity in which the total number of encoding nodes is independent of the size of the network and is bounded by 3 2 . We show that the number of encoding nodes may depend both on and by presenting acyclic coding networks that require ( 2 ) encoding nodes. In the general case of coding networks with cycles, we show that the number of encoding nodes is limited by the size of the minimum feedback link set, i.e., the minimum number of links that must be removed from the network in order to eliminate cycles. We prove that the number of encoding nodes is bounded by (2 + 1) 3 2 , where is the minimum size of a feedback link set. Finally, we observe that determining or even crudely approximating the minimum number of required encoding nodes is an -hard problem.
Network coding capacity: A functional dependence bound
2009 IEEE International Symposium on Information Theory, 2009
Explicit characterization and computation of the multi-source network coding capacity region (or even bounds) is long standing open problem. In fact, finding the capacity region requires determination of the set of all entropic vectors Γ * , which is known to be an extremely hard problem. On the other hand, calculating the explicitly known linear programming bound is very hard in practice due to an exponential growth in complexity as a function of network size. We give a new, easily computable outer bound, based on characterization of all functional dependencies in networks. We also show that the proposed bound is tighter than some known bounds.
On the alphabet size of a linear network code
2008 5th International Conference on Broadband Communications, Networks and Systems, 2008
The alphabet size of a network code is a crucial parameter for the existence of a code in a network topology. In this paper we present a method to compute the alphabet size of a linear network code for an one-source acyclic directed graph using only the outgoing edges from the source. In addition we show a method to reduce the alphabet size for a class of combination networks.
Polynomial time algorithms for 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.
Towards Minimising the Coefficient Vector Overhead in Random Linear Network Coding
Network Coding is a promising approach to increase network throughput and robustness to facilitate high volume traffic. Performing network coding in dynamic network structures requires transmitting coding coefficients for information sinks to decode network coded packets. Compared to the packet sizes used in practical networks, the size of coefficient vectors can be significant. This paper exploits the properties of small and medium sized networks and proposes a novel approach to minimise the coefficient vector size of network coded packets. Simulation results exhibit better compression of coefficient vectors over existing algorithms for small and medium sized networks.
Linear network coding
IEEE Transactions on Information Theory, 2000
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.
The Parametrized Complexity of Some Fundamental Problems in Coding Theory
SIAM Journal on Computing, 1999
The parameterized complexity of a number of fundamental problems in the theory of linear codes and integer lattices is explored. Concerning codes, the main results are that Maximum-Likelihood Decoding and Weight Distribution are hard for the parametrized complexity class W 1]. The NP-completeness of these two problems was established by Berlekamp, McEliece, and van Tilborg in 1978, using a reduction from 3-Dimensional Matching. On the other hand, our proof of hardness for W 1] is based on a parametric polynomialtime transformation from Perfect Code in graphs. An immediate consequence of our results is that bounded-distance decoding is likely to be hard for linear codes. Concerning lattices, we address the Theta Series problem of determining, for an integer lattice and a positive integer k, whether there is a vector x 2 of Euclidean norm k. We prove here for the rst time that Theta Series is NP-complete, and show that it is also hard for W 1]. We furthermore prove that the Nearest Vector problem for integer lattices is hard for W 1]. These problems are the counterparts of Weight Distribution and Maximum-Likelihood Decoding for lattices. Relations between all these problems and combinatorial problems in graphs are discussed.
A joint routing and coding approach to linear network coding
2011 Wireless Advanced, 2011
Adopting a cross-layer approach, in this paper we propose an algorithm for joint routing and network coding. The proposed algorithm jointly assigns routes and designs linear network codes over finite fields to achieve the capacity of the network. The algorithm has a dynamic programming approach where a cost function is used to assign weights to all edges in the network. The cheapest flow is chosen subject to certain encoding constraints in order to achieve the network capacity with network coding while minimizing the network complexity. The effectiveness of the algorithm is demonstrated through carefully chosen examples. We show that the constraints imposed by the joint routing and coding algorithm are necessary for successful decoding at the sinks, and their violation can lead to a failure in achieving the network capacity or an increase in the number of encoding nodes.
Related papers
A Unified Framework for Linear Network Coding
IEEE Transactions on Information Theory, 2000
A condition governing the possibility and impossibility of linear independence among the global encoding kernels of a linear network code is found. Based on this condition, we propose several alternative definitions of generic network codes, which give interpretations of such codes from different perspectives. We also present a unified framework for specifying and constructing different classes of linear network codes. Finally, using the insight obtained from the unified framework, we show that the proofs of some existing results regarding generic network codes can be greatly simplified.
A Chicken & Egg Network Coding Problem
2007
We consider the multi-source network coding problem in cyclic networks. This problem involves several difficulties not found in acyclic networks, due to additional causality requirements. This paper highlights the difficulty of these causality conditions by analyzing two example cyclic networks. The networks appear quite similar at first glance, and indeed both have invalid rate-1 network codes that violate causality. However, the two networks are actually quite different: one also has a valid rate-1 network code obeying causality, whereas the other does not. This unachievability result is proven by a new information inequality for causal coding schemes in a simple cyclic network.
An algebraic approach to network coding
Networking, IEEE/ACM Transactions on, 2003
We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al., who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary networks and robust networking. For networks which are restricted to using linear network codes, we find necessary and sufficient conditions for the feasibility of any given set of connections over a given network. We also consider the problem of network recovery for nonergodic link failures. For the multicast setup we prove that there exist coding strategies that provide maximally robust networks and that do not require adaptation of the network interior to the failure pattern in question. The results are derived for both delay-free networks and networks with delays.
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.
A comparison of network coding and tree packing
2004
In this paper, we consider the problem of information multicast, namely transmitting common information from a sender s to a set of receivers T , in a communication network. Conventionally, in a communication network such as the Internet, this is done by distributing information over a multicast distribution tree. The nodes of such a tree are required only to replicate and forward, i.e., route, information received. Recently, Ahlswede et al.
On the relation between the Index Coding and the Network Coding problems
2008 IEEE International Symposium on Information Theory, 2008
In this paper we show that the Index Coding problem captures several important properties of the more general Network Coding problem. An instance of the Index Coding problem includes a server that holds a set of information messages X = {x1, . . . , x k } and a set of receivers R. Each receiver has some side information, known to the server, represented by a subset of X and demands another subset of X. The server uses a noiseless communication channel to broadcast encodings of messages in X to satisfy the receivers' demands. The goal of the server is to find an encoding scheme that requires the minimum number of transmissions.
Achievable rate regions for network coding
2012 Information Theory and Applications Workshop, 2012
Determining the achievable rate region for networks using routing, linear coding, or non-linear coding is thought to be a difficult task in general, and few are known. We describe the achievable rate regions for three interesting networks and show that achievable rate regions for linear codes need not be convex.
Lexicographic Products and the Power of Non-linear Network Coding
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
We introduce a technique for establishing and amplifying gaps between parameters of network coding and index coding problems. The technique uses linear programs to establish separations between combinatorial and coding-theoretic parameters and applies hypergraph lexicographic products to amplify these separations. This entails combining the dual solutions of the lexicographic multiplicands and proving that this is a valid dual solution of the product. Our result is general enough to apply to a large family of linear programs. This blend of linear programs and lexicographic products gives a recipe for constructing hard instances in which the gap between combinatorial or coding-theoretic parameters is polynomially large. We find polynomial gaps in cases in which the largest previously known gaps were only small constant factors or entirely unknown. Most notably, we show a polynomial separation between linear and non-linear network coding rates. This involves exploiting a connection between matroids and index coding to establish a previously unknown separation between linear and non-linear index coding rates. We also construct index coding problems with a polynomial gap between the broadcast rate and the trivial lower bound for which no gap was previously known.
Searching for Capacity Factors is NP-Complete
In this paper we investigate the problems of searching for the capacity factors and determining the capacity ranks of edges in a network coding-based network, which were first proposed in (K. Cai and P.Y. Fan, 2007). For the former problem, we prove that it is computationally hard by reducing the well known NP-complete SUB-SUM problem to the current problem. For the latter problem, we devise efficient algorithms in a special case of networks and conjecture that in general case the problem is also hard.
Graph Theoretic Methods in Coding Theory
Classical, Semi-classical and Quantum Noise, 2011
This paper is a tutorial on the application of graph theoretic techniques in classical coding theory. A fundamental problem in coding theory is to determine the maximum size of a code satisfying a given minimum Hamming distance. This problem is thought to be extremely hard and still not completely solved. In addition to a number of closed form expressions for special cases and some numerical results, several relevant bounds have been derived over the years.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.