Information multicast in (pseudo-)planar networks: Efficient network coding over small finite fields

Network coding encourages in-network mixing of information flows for enhanced network capacity, particularly for multicast data dissemination. This work aims to explore properties in the underlying network topology for efficient network coding solutions, including efficient code assignment algorithms and efficient encoding/decoding operations that come with small base field sizes. The following cases of (pseudo-)planar types of networks are studied: outer-planar networks where all nodes colocate on a common face, relay/terminal co-face networks where all relay/terminal nodes co-locate on a common face, general planar networks, and apex networks.

[1]  Christina Fragouli,et al.  Network Coding as a Coloring Problem , 2004 .

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

[3]  Zongpeng Li,et al.  Network Coding in Undirected Networks , 2004 .

[4]  Suhas N. Diggavi,et al.  On the capacity of non-coherent network coding , 2009, 2009 IEEE International Symposium on Information Theory.

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

[6]  Greg N. Frederickson,et al.  On Linear-Time Algorithms for Five-Coloring Planar Graphs , 1984, Inf. Process. Lett..

[7]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[8]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[9]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[10]  G. Dirac.  A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs , 1952 .

[11]  Zongpeng Li,et al.  Bounding the Coding Advantage of Combination Network Coding in Undirected Networks , 2012, IEEE Transactions on Information Theory.

[12]  Alexander Sprintson,et al.  Network Coding in Minimal Multicast Networks , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.

[13]  Robin Thomas,et al.  Efficiently four-coloring planar graphs , 1996, STOC '96.

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

[15]  David Eppstein.  Diameter and Treewidth in Minor-Closed Graph Families , 2000, Algorithmica.

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

[17]  Michael Langberg,et al.  Recent Results on the Algorithmic Complexity of Network Coding , 2009 .

[18]  Yunnan Wu,et al.  A unification of network coding and tree-packing (routing) theorems , 2006, TNET.

[19]  Xin Wang,et al.  A graph minor perspective to network coding: Connecting algebraic coding with network topologies , 2013, 2013 Proceedings IEEE INFOCOM.

[20]  Zongpeng Li,et al.  On achieving optimal throughput with network coding , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[21]  Muriel Médard,et al.  Beyond routing: an algebraic approach to network coding , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[22]  Paul D. Seymour,et al.  Colouring series-parallel graphs , 1990, Comb..

[23]  R. L. Brooks.  On Colouring the Nodes of a Network , 1941 .

[24]  Christina Fragouli,et al.  Properties of network polynomials , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.