A Random Linear Network Coding Approach to Multicast

We present a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks. Network nodes independently and randomly select linear mappings from inputs onto output links over some field. We show that this achieves capacity with probability exponentially approaching 1 with the code length. We also demonstrate that random linear coding performs compression when necessary in a network, generalizing error exponents for linear Slepian-Wolf coding in a natural way. Benefits of this approach are decentralized operation and robustness to network changes or link failures. We show that this approach can take advantage of redundant network capacity for improved success probability and robustness. We illustrate some potential advantages of random linear network coding over routing in two examples of practical scenarios: distributed network operation and networks with dynamically varying connections. Our derivation of these results also yields a new bound on required field size for centralized network coding on general multicast networks

[1]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[2]  Imre Csiszár Linear codes for sources and source networks: Error exponents, universal coding , 1982, IEEE Trans. Inf. Theory.

[3]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

[4]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[5]  Kenneth P. Birman,et al.  Bimodal multicast , 1999, TOCS.

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

[7]  Sergio D. Servetto,et al.  Constrained random walks on random graphs: routing algorithms for large scale wireless sensor networks , 2002, WSNA '02.

[8]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[9]  Dana Ron,et al.  Bounds on Linear Codes for Network Multicast , 2003, Electron. Colloquium Comput. Complex..

[10]  P. Chou,et al.  Low complexity algebraic multicast network codes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[11]  R. Koetter,et al.  Network coding from a network flow perspective , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[12]  Muriel Medard,et al.  On Randomized Network Coding , 2003 .

[13]  Peter Sanders,et al.  Polynomial time algorithms for network information flow , 2003, SPAA '03.

[14]  D. Karger,et al.  On Coding for Non-Multicast Networks ∗ , 2003 .

[15]  Takahiro Matsuda,et al.  Performance evaluation of new multicast architecture with network coding , 2003 .

[16]  Murali S. Kodialam,et al.  Online multicast routing with bandwidth guarantees: a new approach using multicast network flow , 2003, TNET.

[17]  R. Koetter,et al.  The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[18]  K. Jain,et al.  Practical Network Coding , 2003 .

[19]  Randall Dougherty,et al.  Linearity and solvability in multicast networks , 2004, IEEE Transactions on Information Theory.

[20]  Yu-Han Chang,et al.  On the utility of network coding in dynamic environments , 2004, International Workshop on Wireless Ad-Hoc Networks, 2004..

[21]  April Rasala Lehman,et al.  Complexity classification of network information flow problems , 2004, SODA '04.

[22]  R. Koetter,et al.  Network Coding for Correlated Sources , 2004 .

[23]  Ying Zhu,et al.  Multicast with network coding in application-layer overlay networks , 2004, IEEE Journal on Selected Areas in Communications.

[24]  Muriel Médard,et al.  Achieving minimum-cost multicast: a decentralized approach based on network coding , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[25]  Peter Sanders,et al.  Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.

[26]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[27]  Fang Zhao,et al.  Minimum-cost multicast over coded packet networks , 2005, IEEE Transactions on Information Theory.

[28]  Christina Fragouli,et al.  Information flow decomposition for network coding , 2006, IEEE Transactions on Information Theory.