By Topic

Pruning network coding traffic by network coding — A new max-flow algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Chih-Chun Wang ; Center for Wireless Systems and Applications (CWSA), School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN 47906, USA

For a unicast/multicast session, network coding is generally implemented via random coding and broadcasting at intermediate nodes, an especially favorable solution in wireless networks. The corresponding broadcast traffic can be minimized by finding the max (s, t)-flow of the network and by sending packets only along the max flow. All existing algorithms for this task, e.g. the push-&-relabel algorithm, are based on the routing paradigm and do not take advantage of the network coded traffic, which undermines their practicality for network coding applications. This work provides the first network-coding-based max (s, t)-flow algorithm starting from broadcasting the coded packets and followed by continuously trimming the unnecessary traffic. The running time is O(|V|2), asymptotically no slower than that of the existing routing-based, distributed algorithms. Other important features include: (i) Limited exchange of control packets enables straightforward distributed implementation. (ii) The source-sink pair sustains uninterruptedly the optimal max-flow rate throughout iterations. (iii) All control packets are sent in the opposite direction of the data packets and can be readily piggybacked to the acknowledgment packets with minimal overhead. (iv) The control packet contains only easily computed coding coefficients and the algorithm imposes no additional requirement on the intermediate nodes nor on the format of each packet.

Published in:

2008 IEEE International Symposium on Information Theory

Date of Conference:

6-11 July 2008