Pruning Network Coding Traffic by Network Coding—A New Class of Max-Flow Algorithms

This work explores new graph-theoretic and algebraic behaviors of network codes and provides a new class of coding-based, distributed max-flow algorithms. The proposed algorithm starts from broadcasting the coded packets, followed by continuously trimming the redundant traffic that does not constitute the maximum flow of the network information. The convergence speed of the proposed algorithms is no slower than that of the existing push-&-relabel max-flow algorithms. The algorithmic results in this work also possess several unique features that are especially suitable for practical network implementation with low control, communication, and complexity overhead.

[1]  Sun-Yuan Kung,et al.  Network planning in wireless ad hoc networks: a cross-Layer approach , 2005 .

[2]  Yunnan Wu,et al.  Minimum-energy multicast in mobile ad hoc networks using network coding , 2004, Information Theory Workshop.

[3]  Xiaojun Lin,et al.  Fast Resource Allocation for Network-Coded Traffic - A Coded-Feedback Approach , 2009, IEEE INFOCOM 2009.

[4]  Christina Fragouli,et al.  Topology inference using network coding , 2012 .

[5]  Ness B. Shroff,et al.  Beyond the Butterfly - A Graph-Theoretic Characterization of the Feasibility of Network Coding with Two Simple Unicast Sessions , 2007, 2007 IEEE International Symposium on Information Theory.

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

[7]  R. Yeung,et al.  NETWORK ERROR CORRECTION , PART I : BASIC CONCEPTS AND UPPER BOUNDS , 2006 .

[8]  Yunnan Wu,et al.  Distributed utility maximization for network coding based multicasting: a shortest path approach , 2006, IEEE Journal on Selected Areas in Communications.

[9]  Yunnan Wu,et al.  Distributed Utility Maximization for Network Coding Based Multicasting: A Critical Cut Approach , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[10]  Yonggang Wen,et al.  Network monitoring in multicast networks using network coding , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[11]  David R. Karger,et al.  A new approach to the minimum cut problem , 1996, JACM.

[12]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

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

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

[15]  Ness B. Shroff,et al.  Utility maximization for communication networks with multipath routing , 2006, IEEE Transactions on Automatic Control.

[16]  Christos Gkantsidis,et al.  An Optimization Framework for Opportunistic Multipath Routing in Wireless Mesh Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[17]  Frank R. Kschischang,et al.  Coding for Errors and Erasures in Random Network Coding , 2008, IEEE Trans. Inf. Theory.

[18]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[19]  R. Koetter,et al.  An algebraic approach to network coding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

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

[21]  Christina Fragouli,et al.  On Feedback for Network Coding , 2007, 2007 41st Annual Conference on Information Sciences and Systems.

[22]  Christina Fragouli,et al.  Loss Tomography in General Topologies with Network Coding , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

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

[24]  R. Srikant,et al.  A tutorial on cross-layer optimization in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

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

[26]  Hsiao-feng Lu.  Binary Linear Network Codes , 2007, 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks.

[27]  Wolfgang Utschick,et al.  Training overhead for decoding random linear network codes in wireless networks , 2009, IEEE Journal on Selected Areas in Communications.

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

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

[30]  Harish Viswanathan,et al.  Dynamic Algorithms for Multicast With Intra-Session Network Coding , 2009, IEEE Transactions on Information Theory.

[31]  Tracey Ho,et al.  Distributed optimization in wireless networks using broadcast advantage , 2007, 2007 46th IEEE Conference on Decision and Control.

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

[33]  Takao Asano,et al.  RECENT DEVELOPMENTS IN MAXIMUM FLOW ALGORITHMS , 2000 .

[34]  Edmund M. Yeh,et al.  Distributed Algorithms for Minimum Cost Multicast with Network Coding in Wireless Networks , 2006 .

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

[36]  R. Koetter,et al.  Distributed Asynchronous Algorithms for Multicast Network Coding , 2005 .

[37]  Angela I. Barbero,et al.  Cycle-logical treatment for "Cyclopathic" networks , 2006, IEEE Transactions on Information Theory.

[38]  Sachin Katti,et al.  Trading structure for randomness in wireless opportunistic routing , 2007, SIGCOMM 2007.

[39]  C. Fragouli,et al.  A Network Coding Approach to Network Monitoring (Invited Paper) , 2005 .