SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
A constant bound on throughput improvement of multicast network coding in undirected networks
IEEE Transactions on Information Theory
Network Coding: An Introduction
Network Coding: An Introduction
Video-centric network coding strategies for 4G wireless networks: an overview
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Modeling network coded TCP throughput: a simple model and its validation
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast
IEEE Transactions on Information Theory
Multicast routing algorithms and protocols: a tutorial
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Network coding has been shown to be the solution that allows to reach the theoretical maximum throughput in a capacitated telecommunication network [1]. It has also been shown to be a very appealing and practical alternative to routing-based approaches to send traffic from sources (servers) to terminals (clients) for many different applications. However, the initial theoretical claim of throughput benefit remains relatively unclear, mainly because the multicast throughput maximization problem is difficult to solve (it is closely related to the fractional Steiner tree packing problem which is NP-hard). In this paper, we show that these optimization problems are still tractable even for instances with a significant size (up to 50 nodes and 300 edges). We also propose and solve the multicast maximum throughput problem with an additional constraint on the number of multicast trees. We apply our algorithms on large sets of randomly generated instances, mainly based on bidirected graphs, because they are the most relevant to model fixed telecommunication infrastructures. The main result of our intensive experimental study is that, in practice, network coding does not increase throughput compared to traditional multicast. Instances showing a throughput gain can only be generated somewhat artificially by imposing some structure or trying to maximize the throughput gap. However, when we limit the number of multicast trees, then, most of the times, very significant throughput gaps appeared. Since management constraints often impose on network administrators a very limited use of multicast trees, network coding appears clearly as a very nice alternative for delivering content to customers.