Pruning network coding traffic by network coding: a new class of max-flow algorithms

Authors:
Chih-Chun Wang
Affiliations:
Center for Wireless Systems and Applications, School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 16
Cited 1

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
A new approach to the minimum cut problem

Journal of the ACM (JACM)
An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
Minimum-cost multicast over coded packet networks

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Cycle-logical treatment for "Cyclopathic" networks

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Trading structure for randomness in wireless opportunistic routing

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Training overhead for decoding random linear network codes in wireless networks

IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Dynamic algorithms for multicast with intra-session network coding

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction

IEEE Transactions on Information Theory
Information flow decomposition for network coding

IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast

IEEE Transactions on Information Theory
Coding for Errors and Erasures in Random Network Coding

IEEE Transactions on Information Theory
Network planning in wireless ad hoc networks: a cross-Layer approach

IEEE Journal on Selected Areas in Communications
A tutorial on cross-layer optimization in wireless networks

IEEE Journal on Selected Areas in Communications
Distributed utility maximization for network coding based multicasting: a shortest path approach

IEEE Journal on Selected Areas in Communications

Distributed network coding-based opportunistic routing for multicast

Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing

Quantified Score

Hi-index	754.84

Visualization

Abstract

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.