Network Coding for Dynamically Changing Networks

We here advocate the case for network coding as a guiding paradigm for the operation of networks that vary in a small time frame, due to node mobility, channel variations, and varying traffic conditions. Three ideas that appeared succesively in time brought in place an elegant operation for network coding in such environments. These are, use of randomized network coding for intermediate node operation, use of generations to avoid synchronization, and use of subspace coding to allow for small packet sizes. Information theoretical performance limits support these results.

[1]  Tracey Ho,et al.  Network Coding: An Introduction , 2008 .

[2]  Christina Fragouli,et al.  Network Coding Applications , 2008, Found. Trends Netw..

[3]  Suhas N. Diggavi,et al.  Noncoherent multisource network coding , 2008, 2008 IEEE International Symposium on Information Theory.

[4]  Suhas N. Diggavi,et al.  Subspace Properties of Randomized Network Coding , 2007, 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks.

[5]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[6]  Frank R. Kschischang,et al.  Using Rank-Metric Codes for Error Correction in Random Network Coding , 2007, 2007 IEEE International Symposium on Information Theory.

[7]  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.

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

[9]  Christina Fragouli,et al.  Network Coding Fundamentals , 2007, Found. Trends Netw..

[10]  Philip A. Chou,et al.  A comparison of network coding and tree packing , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[11]  Jörg Widmer,et al.  Network coding: an instant primer , 2006, CCRV.

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

[13]  Frank R. Kschischang,et al.  Coding for Errors and Erasures in Random Network Coding , 2007, IEEE Transactions on Information Theory.

[14]  Yunnan Wu,et al.  Network Coding for the Internet and Wireless Networks , 2007, IEEE Signal Processing Magazine.

[15]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[16]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[17]  R. Koetter,et al.  Breaking network logjams. , 2007, Scientific American.

[18]  T. Ho,et al.  On Linear Network Coding , 2010 .

[19]  Ning Cai,et al.  Network Error Correction, II: Lower Bounds , 2006, Commun. Inf. Syst..

[20]  April Rasala Lehman.  Network coding , 2005 .

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

[22]  Ning Cai,et al.  Network Error Correction, I: Basic Concepts and Upper Bounds , 2006, Commun. Inf. Syst..