On the multiple unicast network coding conjecture

Authors:
Michael Langberg;Muriel Médard
Affiliations:
Computer Science Division, Open University of Israel, Raanana, Israel;Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 10
Cited 0

An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
Network coding

Network coding
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
On the capacity of information 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
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction

IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast

IEEE Transactions on Information Theory
Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the multiple unicast network communication problem on undirected graphs. It has been conjectured by Li and Li [CISS 2004] that, for the problem at hand, the use of network coding does not allow any advantage over standard routing. Loosely speaking, we show that under certain (strong) connectivity requirements the advantage of network coding is indeed bounded by 3.