Skip to main content
Springer Nature Link
Log in

A Minimum Cost Multicast Routing Algorithm with the Consideration of Dynamic User Membership

  • Conference paper
Information Networking. Convergence in Broadband and Mobile Networking (ICOIN 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3391))

Included in the following conference series:

  • 992 Accesses

Abstract

In this paper, we attempt to solve the problem of constructing a minimum cost multicast tree with the consideration of dynamic user membership. Unlike the other minimum cost multicast tree algorithms, this problem consists of one multicast group of fixed members and each destination member is dynamic and has a probability of being active as which was gathered by observation over some period of time. With the omission of node join/leave handling, this model is suitable for prediction and planning purpose than for online maintenance of multicast trees. We formally model this problem as an optimization problem and apply the Lagrangean relaxation method and the subgradient method to solve the problem. Computational experiments are performed on regular networks and random networks. According to the experiment results, the Lagrangean based heuristic can achieve up to 37.69% improvement compared to the simple heuristic.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Winter, P.: Steiner Problem in Networks: A Survey. Networks, 129–167 (1987)

    Google Scholar 

  2. Hwang, F.K.: Steiner Tree Problems. Networks, 55–89 (1992)

    Google Scholar 

  3. Alvarez-Hamelin, J.I., Fraigniaud, P., Alberto, D.: Survey of multicast trees construction, Algotel 01, Saint Jean de Luz, France (2001)

    Google Scholar 

  4. Fisher, M.L.: The Lagrangian Relaxation Method for Solving Integer Programming Problems. Management Science 27, 1–18 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Management, National Taiwan University, 50, Lane 144, Keelung Rd., Sec.4, Taipei, Taiwan, R.O.C.

    Frank Yeong-Sung Lin, Hsu-Chen Cheng & Jung-Yao Yeh

Authors
  1. Frank Yeong-Sung Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hsu-Chen Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jung-Yao Yeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Pohang University of Science and Technology (POSTECH), San 31 HyoJa-Dong, Nam-Gu, 790-784, Pohang, Korea

    Cheeha Kim

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, F.YS., Cheng, HC., Yeh, JY. (2005). A Minimum Cost Multicast Routing Algorithm with the Consideration of Dynamic User Membership. In: Kim, C. (eds) Information Networking. Convergence in Broadband and Mobile Networking. ICOIN 2005. Lecture Notes in Computer Science, vol 3391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30582-8_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30582-8_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24467-7

  • Online ISBN: 978-3-540-30582-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation