Skip to main content
Springer Nature Link
Log in

On Multicast Communications with Minimum Resources

  • Conference paper
High Performance Computing and Communications (HPCC 2005)

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

Abstract

We have developed and evaluated an efficient heuristic algorithm to construct a multicast tree with the minimum cost. Our algorithm uses multiple candidate paths to select a path from source to each destination, and works on directed asymmetric networks. We also show that our proposed algorithm have a perform gain in terms of tree cost for real life networks over existing algorithm. The time complexity of our algorithm is O( D (m + nlog n) ) for a m-arc n-node network with D number of members in the multicast group, and is comparable to well-known algorithm, TM [13], for a multicast tree construction in terms of the time-complexity. We have performed empirical evaluation that compares our algorithms with the others on large networks.

Research of Dr. Bang is sponsored by the Ministry of Commerce, Industry and Energy under Next-Generation Growth Engine Industry. Research of Dr. Joo is sponsored by ETRI and the Ministry of Information and Communication in Republic of Korea. Dr. Bang is the corresponding author.

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. Ajuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)

    Google Scholar 

  2. Bang, Y.-C., Choo, H.: On multicasting with minimum costs for the internet topology. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol. 2400, pp. 736–744. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Bauer, F., Varma, A.: Distributed algorithms for multicast path setup in data networks. IEEE/ACM Transactions on Networking 4(2), 181–191 (1996)

    Article  Google Scholar 

  4. Chen, S., Nahrstedt, K., Shavitt, Y.: A QoS-Aware Multicast Routing Protocol. IEEE Journal on Selected Areas in Communications 18(12), 2580–2592 (2000)

    Article  Google Scholar 

  5. Doar, M., Leslie, I.: How Bad is Naive Multicast Routing? In: Proc. IEEE INFOCOM 1993, pp. 82–89 (1993)

    Google Scholar 

  6. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco (1979)

    MATH  Google Scholar 

  7. Kadaba, B.K., Jaffe, J.M.: Routing to multiple destinations in computer networks. IEEE Transactions on Communications, COM-31 (3), 343–351 (1983)

    Google Scholar 

  8. Kompella, V.P., Pasquale, J.C., Polyzoa, G.C.: Multicast routing for multimedia communications. IEEE/ACM Transactions on Networking 1(3), 286–292 (1993)

    Article  Google Scholar 

  9. Kou, L., Markowsky, G., Berman, L.: A fast algorithm for steiner trees. Acta Informatica 15, 145–151 (1981)

    Article  MathSciNet  Google Scholar 

  10. Ramanathan, S.: Multicast tree generation in networks with asymetric links. IEEE/ACM Transactions on Networking 4(4), 558–568 (1996)

    Article  MathSciNet  Google Scholar 

  11. Rodionov, A.S., Choo, H.: On generating random network structures: Connected graphs. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol. 3090, pp. 483–491. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  12. Prim, R.C.: Shortest Connection Networks And Some Generalizations. Bell System Techn. J. 36, 1389–1401 (1957)

    Google Scholar 

  13. Takahashi, H., Matsuyama, A.: An Approximate Solution for the Steiner Problem in Graphs. Mathematica Japonica 24(6), 573–577 (1980)

    MATH  MathSciNet  Google Scholar 

  14. Waxman, B.M.: Routing of multipoint connections. IEEE Journal on Selected Areas in Communications 6(9) (1988)

    Google Scholar 

  15. Zhu, Q., Parsa, M., Garcia-Luna-Aceves, J.J.: A source-based algorithm for delay constrained minimum-cost multicasting. In: Proc. IEEE INFOCOM 1995, pp. 377–385 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Korea Polytechnic University, 429-793, Gyeonggi-Do, Korea

    Young-Cheol Bang & SungTaek Chung

  2. School of Information and Communication Engineering, Sungkyunkwan University, 440-746, Suwon, Korea

    Moonseong Kim

  3. Carrier Ethernet Team, Electronics and Telecommunications Research Institute, Daejun, Korea

    Seong-Soon Joo

Authors
  1. Young-Cheol Bang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. SungTaek Chung
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Moonseong Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Seong-Soon Joo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, St. Francis Xavier University, Antigonish, Canada

    Laurence T. Yang

  2. School of Computer Science/Welsh eScience Centre, Cardiff University, UK

    Omer F. Rana

  3. Dipartimento di Ingegneria dell’ Informazione - Second, University of Naples - Italy, Real Casa dell’Annunziata - via Roma, 29 81031, Aversa (CE), Italy

    Beniamino Di Martino

  4. Computer Science Department, University of Tennessee, 37996-3450, Knoxville, TN, USA

    Jack Dongarra

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bang, YC., Chung, S., Kim, M., Joo, SS. (2005). On Multicast Communications with Minimum Resources. In: Yang, L.T., Rana, O.F., Di Martino, B., Dongarra, J. (eds) High Performance Computing and Communications. HPCC 2005. Lecture Notes in Computer Science, vol 3726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11557654_4

Download citation

  • DOI: https://doi.org/10.1007/11557654_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29031-5

  • Online ISBN: 978-3-540-32079-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics