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

IEEE Transactions on Information Theory

Volumn 56, Issue 4, 2010, Pages 1909-1929

  Wang, Chih Chun ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

Coded feedback; Max flow algorithms; Multipath routing; Network coding; Network multi cast; Random linear coding

Indexed keywords

CODED PACKET; CONVERGENCE SPEED; GRAPH-THEORETIC; LINEAR CODING; MAX FLOW ALGORITHM; MAXIMUM FLOWS; MULTI PATH ROUTING; NETWORK CODES; NETWORK CODING; NETWORK INFORMATION; REDUNDANT TRAFFIC; UNIQUE FEATURES;

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; INFORMATION THEORY; PARALLEL PROCESSING SYSTEMS;

BROADCASTING;

EID: 77950221034     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2040859     Document Type: Article

References (38)

1. A. Barbero and O. Ytrehus, "Cycle-logical treatment for cyclopathic networks," IEEE Trans. Inf. Theory, vol.52, no.6, pp. 2795-2804, Jun. 2006.
2. S. Chachulski, M. Jennings, S. Katti, and D. Katabi, "Trading structure for randomness in wireless opportunistic routing," in Proc. ACM Special Interest Group on Data Commun. (SIGCOMM), Kyoto, Japan, Aug. 2007.
3. P. Chou, Y.Wu, and K. Jain, "Practical network coding," in Proc. 41st Ann. Allerton Conf. on Commun., Contr., and Comput.,Monticello, IL, Oct. 2003.
4. T. Cui, L. Chen, and T. Ho, "Distributed optimization in wireless networks using broadcast advantage," in Proc. 46th IEEE Conf. Decision Contr., New Orleans, LA, Dec. 2007.
5. C. Fragouli, D. Lun, M. Médard, and P. Pakzad, "On feedback for network coding," in Proc. 41st Conf. Inf. Sci. Syst., 2007.
6. C. Fragouli and A. Markopoulou, "A network coding approach to network monitoring," in Proc. 43rd Ann. Allerton Conf. on Commun., Contr., Comput., Monticello, IL, Oct. 2005.
7. C. Fragouli, A. Markopoulou, and S. Diggavi, "Topology inference using network coding," in Proc. 44th Ann. Allerton Conf. Commun., Contr., Comput., Monticello, IL, Oct. 2006.
8. C. Fragouli and E. Soljanin, "Information flow decomposition for network coding," IEEE Trans. Inf. Theory, vol.52, no.3, pp. 829-848, Mar. 2006.
9. M. Gjoka, C. Fragouli, P. Sattri, and A. Markopoulou, "Loss tomography in general topologies with network coding," in Proc. 2007 Global Telecommun. Conf. (GLOBECOM), Nov. 2007, pp. 381-386.
10. A. Goldberg, Recent Developments in Maximum Flow Algorithms NEC Res. Inst., Inc., Tech. Rep. 98-1045, 1998.
11. A. Goldberg and R. Tarjan, "A new approach to the maximum-flow problem," J. ACM, vol.35, no.4, pp. 921-940, Oct. 1988.
12. T. Ho, B. Leong, Y.-H. Chang, Y.Wen, and R.Koetter, "Network monitoring in multicast networks using network coding," in Proc. IEEE Int. Symp. Inf. Theory , Adelaide, Australia, Sep. 2005, pp. 1977-1981.
13. T. Ho, B. Leong, R. Koetter, and M. Médard, "Distributed asynchronous algorithms for multicast network coding," in Proc. 1st Workshop on Netw. Coding, Theory, and Appl. Riva del Garda, Italy, Apr. 2005.
14. T. Ho, M. Médard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast," IEEE Trans. Inf. Theory, vol.52, no.10, pp. 4413-4430, Oct. 2006.
15. T. Ho and H. Viswanathan, "Dynamic algorithms for multicast with intra-session network coding," IEEE Trans. Inf. Theory, vol.55, no.2, pp. 797-815, Feb. 2009.
16. M. Jafarisiavoshani, C. Fragouli, and S. Diggavi, "Subspace properties of randomized network coding," in Proc. IEEE Inf. Theory Workshop, Jul. 2007, pp. 1-5.
17. S. Jaggi, P. Sanders, P. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen, "Polynomial time algorithms for multicast network code construction," IEEE Trans. Inf. Theory, vol.51, 2005.
18. D. Karger and C. Stein, "A newapproach to the minimum cut problem," J. ACM, vol.43, no.4, pp. 601-640, Jul. 1996.
19. R. Koetter and F. Kschischang, "Coding for errors and erasures in random network coding," IEEE Trans. Inf. Theory, vol.54, no.8, pp. 3579-3591, Aug. 2008.
20. R.Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Networking, vol.11, no.5, pp. 782-795, Oct. 2003.
21. S.-Y. Li, R. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol.49, no.2, pp. 371-381, Feb. 2003.
22. Z. Li and B. Li, "Efficient and distributed computation of maximum multicast rates," in Proc. 24th IEEE Conf. Comput. Commun. (INFOCOM), Miami, FL, Mar. 2005.
23. Z. Li, B. Li, D. Jiang, and L. Lau, "On achieving optimal throughput with network coding," in Proc. 24th IEEE Conf. Comput. Commun. (INFOCOM), Miami, FL, USA, Mar. 2005.
24. X. Lin and N. Shroff, "Utility maximization for communication networks with multi-path routing," IEEE Trans. Autom. Control, vol.51, no.5, pp. 766-781, May 2006.
25. X. Lin, N. Shroff, and R. Srikant, "A tutorial on cross-layer optimization in wireless networks," IEEE J. Sel. Areas Commun., vol.24, no.8, pp. 1452-1463, Aug. 2006.
26. H.-F. Lu, "Binary linear network codes," in Proc. 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, July 2007, pp. 1-5.
27. D. Lun, N. Ratnakar, M. Médard, R. Koetter, D. Karger, T. Ho, E. Ahmed, and F. Zhao, "Minimum-cost multicast over coded packet networks," IEEE Trans. Inform. Theory, vol.52, no.6, pp. 2608-2623, Jun. 2006.
28. B. Radunović, C. Gkantsidis, P. Key, and P. Rodriguez, "An optimization framework for opportunistic multipath routing in wireless mesh networks," in Proc. 27th IEEE Conf. Computer Commun. (INFOCOM), Phoenix, AZ, 2008.
29. M. Riemensberger, Y. Sagduyu, M. Honig, and W. Utschick, "Training overhead for decoding random linear network codes in wireless networks," IEEE J. Sel. Areas Commun., vol.27, no.5, pp. 729-737, Jun. 2009.
30. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Autom. Control, vol.37, no.12, pp. 1936-1948, Dec. 1992.
31. C.-C. Wang and X. Lin, "Fast resource allocation for network-coded traffic-A coded-feedback approach," in Proc. 28th IEEE Conf. Comput. Commun. (INFOCOM), Rio de Janeiro, Brazil, Apr. 2009.
32. C.-C. Wang and N. Shroff, "Beyond the butterfly-A graph-theoretic characterization of the feasibility of network coding with two simple unicast sessions," in Proc. IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 2007.
33. Y. Wu, M. Chiang, and S.-Y. Kung, "Distributed utility maximization for network coding based multicasting: A critical cut approach," in Proc. 2ndWorkshop on Netw. Coding, Theory, Appl. (NetCod), Boston, MA, Apr. 2006.
34. Y. Wu, P. Chou, and S.-Y. Kung, "Minimum-energy multicast in mobile ad hoc networks using network coding," IEEE Trans. Commun., vol.53, no.11, pp. 1906-1918, Nov. 2005.
35. Y.Wu, P. Chou, Q. Zhang, K. Jain, W. Zhu, and S.-Y. Kung, "Network planning in wireless ad hoc networks: A cross-layer approach," IEEE J. Sel. Areas Commun., vol.23, no.1, pp. 136-150, Jan. 2005.
36. Y. Wu and S.-Y. Kung, "Distributed utility maximization for network coding based multicasting: A shortest path approach," IEEE J. Sel. Areas Commun., vol.24, pp. 1475-1488, Aug. 2006.
37. Y. Xi and E. Yeh, "Distributed algorithms for minimum cost multicast with network coding in wireless networks," in Proc. 4th Int. Symp. Model. Optimiz. Mobile, Ad Hoc and Wireless Netw., Apr. 2006.
38. R. Yeung and N. Cai, "Network error correction, part I: Basic concepts and upper bounds," Commun. Inf. Syst., vol.6, no.1, pp. 19-36, 2006.