The Capacity Region for Multi-source Multi-sink Network Coding

The capacity problem for general acyclic multi- source multi-sink networks with arbitrary transmission requirements has been studied by L. Song, et al (2003). Specifically, inner and outer bounds of the capacity region were derived respectively in terms of Gamman* and Gamma macrn*, the fundamental regions of the entropy function. In this paper, we show that by carefully bounding the constrained regions in the entropy space, we obtain the exact characterization of the capacity region, thus closing the existing gap between the above inner and outer bounds.

[1]  Robert D. Kleinberg,et al.  On the capacity of information networks , 2006, SODA 2006.

[2]  R. Yeung,et al.  Network coding theory , 2006 .

[3]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[4]  Robert D. Kleinberg,et al.  On the capacity of information networks , 2006, IEEE Transactions on Information Theory.

[5]  Raymond W. Yeung,et al.  A First Course in Information Theory , 2002 .

[6]  Zhen Zhang,et al.  An outer bound for multisource multisink network coding with minimum cost consideration , 2006, TNET.

[7]  Serap A. Savari,et al.  Edge-Cut Bounds on Network Coding Rates , 2006, Journal of Network and Systems Management.

[8]  Lihua Song,et al.  Zero-error network coding for acyclic network , 2003, IEEE Trans. Inf. Theory.

[9]  Shuo-Yen Robert Li,et al.  Network Coding Theory - Part I: Single Source , 2005, Found. Trends Commun. Inf. Theory.