Optimal attack and reinforcement of a network
Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks
SIAM Journal on Computing
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
SIAM Journal on Discrete Mathematics
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Informed content delivery across adaptive overlay networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial time algorithms for network information flow
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Optimal distributed multicast routing using network coding: theory and applications
ACM SIGMETRICS Performance Evaluation Review
Edge-Cut Bounds on Network Coding Rates
Journal of Network and Systems Management
On the capacity of information networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Unachievability of network coding capacity
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On average throughput and alphabet size in network coding
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On achieving maximum multicast throughput in undirected networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Minimum-cost multicast over coded packet networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On the capacity of multiple unicast sessions in undirected graphs
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
A First Course in Information Theory (Information Technology: Transmission, Processing and Storage)
A First Course in Information Theory (Information Technology: Transmission, Processing and Storage)
A high-throughput overlay multicast infrastructure with network coding
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
LION: Layered Overlay Multicast With Network Coding
IEEE Transactions on Multimedia
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction
IEEE Transactions on Information Theory
Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks
IEEE Transactions on Information Theory
Network planning in wireless ad hoc networks: a cross-Layer approach
IEEE Journal on Selected Areas in Communications
A Cross-Layer Optimization Framework for Multihop Multicast in Wireless Mesh Networks
IEEE Journal on Selected Areas in Communications
General Scheme for Perfect Quantum Network Coding with Free Classical Communication
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Multicast capacity-delay tradeoff with network coding in MANETs
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Some further investigation on maximum throughput: does network coding really help?
Proceedings of the 24th International Teletraffic Congress
| Hi-index | 754.84 |
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.