Advertisement

Journal of Combinatorial Optimization

, Volume 9, Issue 4, pp 349–356 | Cite as

An Improved Approximation Algorithm for Multicast k-Tree Routing

  • Guohui Lin
Article

Abstract

An improved approximation algorithm is presented in this paper for the multicast k-tree routing problem. The algorithm has a worst case performance ratio of (2.4 + ρ), where ρ is the best approximation ratio for the metric Steiner tree problem (and is about 1.55 so far). The previous best approximation algorithm for the multicast k-tree routing problem has a performance ratio of 4. Two techniques, weight averaging and tree partitioning, are developed to facilitate the algorithm design and analysis.

Keywords

approximation algorithm multicast k-tree routing Steiner minimum tree weight averaging tree partitioning 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, San Francisco, 1979.Google Scholar
  2. C. Gröpl, S. Hougardy, T. Nierhoff, and H.J. Prömel, “Approximation algorithms for the Steiner tree problem in graphs,” In D.-Z. Du and X. Cheng (Eds.), Steiner Trees in Industries, Kluwer Academic Publishers, 2001, pp. 235–279.Google Scholar
  3. J. Gu, X.D. Hu, and M.H. Zhang, “Algorithms for multicast connection under multi-path routing model,” Information Processing Letters, vol. 84, pp. 31–39, 2002.CrossRefGoogle Scholar
  4. R.L. Hadas. “Efficient collective communication in WDM networks,” in Proceedings of IEEE ICCCN 2000, 2000, pp. 612–616.Google Scholar
  5. X.-D. Hu, T.-P. Shuai, X. Jia, and M. H. Zhang, “Multicast routing and wavelength assignment in WDM networks with limited drop-offs,” In Proceedings of IEEE INFOCOM 2004, 2004.Google Scholar
  6. C. Huitema, Routing in the Internet. Prentice Hall PTR, 2000.Google Scholar
  7. F. Kuo, W. Effelsberg, and J.J. Garcia-Luna-Aceves, Multimedia Communications: Protocols and Applications. Prentice Hall, Inc., 1998.Google Scholar
  8. G. Robins and A. Zelikovsky, “Improved Steiner tree approximation in graphs,” in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), 2000, pp. 770–779.Google Scholar
  9. A.S. Tanenbaum, Computer Networks. Prentice Hall PTR, Upper Saddle River, NJ, 1996.Google Scholar
  10. Z. Wang and J. Crowcroft, “Quality-of-service routing for supporting multimedia applications,” IEEE Journal on Selected Areas in Communications, vol. 14, pp. 1228–1234, 1996.CrossRefGoogle Scholar
  11. X. Zhang, J. Wei, and C. Qiao, “Constrained multicast routing in WDM networks with sparse light splitting,” in Proceedings of IEEE INFOCOM 2000, March 26–30, 2000, pp. 1781–1790.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  1. 1.Department of Computing ScienceUniversity of Alberta. EdmontonAlbertaCanada

Personalised recommendations