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

  • Chih-Chun Wang
  • Published 2010 in IEEE Transactions on Information Theory

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 <i>maximum flow</i> of the network information. The convergence speed of the proposed algorithms is no slower than that of the existing push-&amp;-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.

8 Figures and Tables

Cite this paper

@article{Wang2010PruningNC, title={Pruning Network Coding Traffic by Network Coding—A New Class of Max-Flow Algorithms}, author={Chih-Chun Wang}, journal={IEEE Transactions on Information Theory}, year={2010}, volume={56}, pages={1909-1929} }