A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks
Zongpeng Li
Baochun Li
Lap Chi Lau
Dept. of Comput. Sci., Univ. of Calgary, Calgary, AB;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: March 2009
Volume: 55,
Issue: 3
On page(s): 1016-1026
ISSN: 0018-9448
INSPEC Accession Number: 10479242
Digital Object Identifier: 10.1109/TIT.2008.2011516
Current Version Published: 2009-02-24
Abstract
Recent research in network coding shows that, joint consideration of both coding and routing strategies may lead to higher information transmission rates than routing only. A fundamental question in the field of network coding is: how large can the throughput improvement due to network coding be? In this paper, we prove that in undirected networks, the ratio of achievable multicast throughput with network coding to that without network coding is bounded by a constant ratio of 2, i.e., network coding can at most double the throughput. This result holds for any undirected network topology, any link capacity configuration, any multicast group size, and any source information rate. This constant bound 2 represents the tightest bound that has been proved so far in general undirected settings, and is to be contrasted with the unbounded potential of network coding in improving multicast throughput in directed networks.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
