Coding advantage in communications among peers
Kai Cai, Guangyue Han · 2016
We consider the problem of network coding advantage in a communication scenario where information exchange is bi-directional and peers communicate via multiple unicast sessions. In such a setting, we study the overall performance of all multiple unicast sessions and propose a version of the multiple unicast conjecture. One of our main results is a weaker version of the proposed conjecture: Consider all the multiple unicast sessions associated with a number of terminals in an undirected network. Then, the common transmission rate of all these multiple unicast sessions achieved by network coding in the sense of Langberg and Médard [13] can also be achieved by fractional routing.