Skip to main content

Improved Approximation Algorithms for the Capacitated Multicast Routing Problem

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 3595)

Abstract

Two models for the Capacitated Multicast Routing Problem are considered, which are the Multicast k-Path Routing and the Multicast k-Tree Routing. Under these models, two improved approximation algorithms are presented, which have worst case performance ratios of 3 and (2 + ρ), respectively. Here ρ denotes the best approximation ratio for the Steiner Minimum Tree problem, and it is about 1.55 at the writing of the paper. The two approximation algorithms improve upon the previous best ones having performance ratios of 4 and (2.4 + ρ), respectively. The designing techniques developed in the paper could be applicable to other similar networking problems.

Keywords

  • Capacitated Multicast Routing
  • Approximation Algorithm
  • Steiner Minimum Tree
  • Tree Partitioning

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/11533719_16
  • Chapter length: 10 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   159.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-31806-4
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   209.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Altinkemer, K., Gavish, B.: Heuristics with constant error guarantees for the design of tree networks. Management Science 34, 331–341 (1988)

    MathSciNet  CrossRef  MATH  Google Scholar 

  2. Cai, Z.: Improved algorithm for multicast routing and binary fingerprint vector clustering. Master’s thesis, Department of Computing Science, University of Alberta, June 16 (2004)

    Google Scholar 

  3. Cai, Z., Lin, G.-H., Xue, G.L.: Improved approximation algorithms for the capacitated multicast routing problem. Technical Report TR04-12, Department of Computing Science, University of Alberta (July 2004)

    Google Scholar 

  4. Gröpl, C., Hougardy, S., Nierhoff, T., Prömel, H.J.: Approximation algorithms for the Steiner tree problem in graphs. In: Du, D.-Z., Cheng, X. (eds.) Steiner Trees in Industries, pp. 235–279. Kluwer Academic Publishers, Dordrecht (2001)

    CrossRef  Google Scholar 

  5. Gu, J., Hu, X.D., Jia, X., Zhang, M.-H.: Routing algorithm for multicast under multi-tree model in optical networks. Theoretical Computer Science 314, 293–301 (2004)

    MathSciNet  CrossRef  MATH  Google Scholar 

  6. Gu, J., Hu, X.D., Zhang, M.-H.: Algorithms for multicast connection under multi-path routing model. Information Processing Letters 84, 31–39 (2002)

    MathSciNet  CrossRef  MATH  Google Scholar 

  7. Hadas, R.L.: Efficient collective communication in WDM networks. In: Proceedings of IEEE ICCCN 2000, pp. 612–616 (2000)

    Google Scholar 

  8. Huitema, C.: Routing in the Internet. Prentice Hall PTR, Englewood Cliffs (2000)

    Google Scholar 

  9. Jothi, R., Raghavachari, B.: Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 805–818. Springer, Heidelberg (2004)

    CrossRef  Google Scholar 

  10. Kuo, F., Effelsberg, W., Garcia-Luna-Aceves, J.J.: Multimedia Communications: Protocols and Applications. Prentice Hall, Inc., Englewood Cliffs (1998)

    Google Scholar 

  11. Lin, G.-H.: An improved approximation algorithm for multicast k-tree routing. Journal of Combinatorial Optimization (2005), in press (final version available upon request)

    Google Scholar 

  12. Robins, G., Zelikovsky, A.Z.: Improved Steiner tree approximation in graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pp. 770–779 (2000)

    Google Scholar 

  13. Tanenbaum, S.: Computer Networks. Prentice Hall PTR, Upper Saddle River (1996)

    Google Scholar 

  14. Wang, Z., Crowcroft, J.: Quality-of-service routing for supporting multimedia applications. IEEE Journal on Selected Areas in Communications 14, 1228–1234 (1996)

    CrossRef  Google Scholar 

  15. Zhang, X., Wei, J., Qiao, C.: Constrained multicast routing in WDM networks with sparse light splitting. In: Proceedings of IEEE INFOCOM 2000, March 26–30, pp. 1781–1790 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cai, Z., Lin, G., Xue, G. (2005). Improved Approximation Algorithms for the Capacitated Multicast Routing Problem. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_16

Download citation

  • DOI: https://doi.org/10.1007/11533719_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28061-3

  • Online ISBN: 978-3-540-31806-4

  • eBook Packages: Computer ScienceComputer Science (R0)