Achieving minimum-cost multicast: A decentralized approach based on network coding

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 2005, Pages 1608-1617

  Lun, Desmond S ^a   Ratnakar, Niranjan ^b   Koetter, Ralf ^b   Médard, Muriel ^a   Ahmed, Ebad ^a   Lee, Hyunjoo ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ENCODING (SYMBOLS); PROBLEM SOLVING; WIRELESS TELECOMMUNICATION SYSTEMS;

DECENTRALIZED ALGORITHMS; ELASTIC RATE; POINT-TO-POINT LINK; STEINER TREE PROBLEM;

MULTICASTING;

EID: 25844504259     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. S. Ramanathan, "Multicast tree generation in networks with asymmetric links," IEEE/ACM Trans. Networking, vol. 4, no. 4, pp. 558-568, Aug. 1996.
2. L. Zosin and S. Khuller, "On directed Steiner trees" in Proc, 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), 2002, pp. 59-63.
3. M. Charikar, C. Chekuri, T.-y. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, "Approximation algorithms for directed Steiner problems," in Proc. Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), 1998, pp. 192-200.
4. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inform. Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
5. 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.
6. D. S. Lun, M. Médard, T. Ho, and R. Koetter, "Network coding with a cost criterion," in Proc. 2004 International Symposium on Information Theory and its Applications (ISITA 2004), Oct. 2004.
7. T. Ho, M. Médard, R. Koetter, D. R. Karger, M. Effros, J. Shi, and B. Leong, "Toward a random operation of networks," submitted to IEEE Trans. Inform. Theory.
8. T. Ho, M. Médard, J. Shi, M. Effros, and D. R. Karger, "On randomized network coding," in Proc. 41st Annual Allerton Conference on Communication, Control, and Computing, Oct. 2003.
9. T. Ho, R. Koetter, M. Médard, D. R. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proc. 2003 IEEE International Symposium on Information Theory (ISIT 2003), 2003.
10. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. 41st Annual Allerton Conference on Communication, Control. and Computing, Oct. 2003.
11. T. Ho, B. Leong, M. Médard, R. Koetter, Y.-H. Chang, and M. Effros, "On the utility of network coding in dynamic environments," in Proc. 2004 International Workshop on Wireless Ad-hoc Networks (IWWAN 2004), 2004.
12. D. P. Bertsekas and R. Gallager, Data Networks, 2nd ed. Upper Saddle River, NJ: Prentice Hall, 1992.
13. R. Mahajan, N. Spring, D. Wetherall, and T. Anderson, "Inferring link weights using end-to-end measurements," in Proc. Second Internet Measurement Workshop (IMW 2002), 2002.
14. D. P. Bertsekas, Network Optimization: Continuous and Discrete Models. Belmont, MA: Athena Scientific, 1998.
15. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Upper Saddle River, NJ: Prentice Hall, 1993.
16. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Englewood Cliffs, NJ: Prentice Hall, 1989.
17. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization. New York, NY: John Wiley & Sons, 1999.
18. H. D. Sherali and G. Choi, "Recovery of primal solutions when using subgradient optimization methods to solve langrangian duals of linear programs," Oper. Res. Lett., vol. 19, pp. 105-113, 1996.
19. D. P. Bertsekas, L. C. Polymenakos, and P. Tseng, "An ε-relaxation method for separable convex cost network flow problems," SIAM J. Optim., vol. 7, no. 3, pp. 853-870, Aug. 1997.
20. R. de Leone, R. R. Meyer, and A. Zakarian, "A partitioned ε-relaxation algorithm for separable convex network flow problems," Computational Optimization and Applications, vol. 12, no. 1-3, pp. 107-126, Jan. 1999.
21. R. Srikant, The Mathematics of Internet Congestion Control. Boston, MA: Brikhäuser, 2004.
22. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, "Energy- efficient broadcast and multicast trees in wireless networks," Mobile Networks and Applications, vol. 7, pp. 481-492, 2002.
23. A. Ahluwalia, E. Modiano, and L. Shu, "On the complexity and distributed construction of energy-efficient broadcast trees in static ad hoc wireless networks," in Proc. 2002 Conference on Information Sciences and Systems (CISS 2002), Mar. 2002.
24. W. Liang, "Constructing minimum-energy broadcast trees in wireless ad hoc networks," in Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking & Computing (MOBIHOC '02), 2002, pp. 112-122.
25. Y. Wu, P. A. Chou, and S.-Y. Kung, "Minimum-energy multicast in mobile ad hoc networks using network coding," submitted to IEEE Trans. Commun.
26. D. S. Lun, M. Médard, and M. Effros, "On coding for reliable communication over packet networks," in Proc. 42nd Annual Allerton Conference on Communication, Control, and Computing, Sept.-Oct. 2004, invited paper.
27. D. P. Bertsekas, Nonlinear Programming. Belmont, MA: Athena Scientific, 1995.