Skip to main content
SpringerLink
Log in

Source-Based Minimum Cost Multicasting: Intermediate-Node Selection with Potentially Low Cost

  • Conference paper
Advances in Informatics (PCI 2005)

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

Included in the following conference series:

Abstract

In this paper, we propose a novel heuristic algorithm for constructing a minimum cost multicast tree. Our work is based on a directed asymmetric network and shows an improvement in terms of network cost for general random topologies close to real networks. It is compared to the most effective scheme proposed earlier by Takahashi and Matsuyama (TM) [18]. We have experimented comprehensive computer simulations and the performance enhancement is up to about 4.7% over TM. The time complexity of ours is O(kn 2) for an n-node network with k members in the multicast group which is comparable to those of previous works [12,18].

This work was supported in parts by BK 21 and the Ministry of Information and Communication, Republic of Korea. Corresponding author: H. Choo

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 

  2. Bauer, F., Varma, A.: ARIES: A rearrangeable inexpensive edge-based on-line Steiner Algorithm. IEEE Journal on Selected Areas in Communications, vol 15(3), 382–397 (1997)

    Article  Google Scholar 

  3. Bertsckas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1992)

    Google Scholar 

  4. Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  5. Doar, M., Leslie, I.: How bad is naive multicast routing. In: Proceedings of the IEEE INFOCOM, pp. 82–89 (1993)

    Google Scholar 

  6. Du, D.Z., Lu, B., Ngo, H., Pardalos, P.M.: Steiner Tree Problems. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of optimization, vol. 5, pp. 227–290. Kluwer Academic Publishers, Dordrecht (2001)

    Google Scholar 

  7. 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 

  8. Hwang, F.K., Richards, D.: Steiner Tree Problems. Networks 22, 55–89 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kadaba, B.K., Jaffe, J.M.: Routing to Multiple Destinations in Computer Networks. IEEE Transactions on Communications, COM-31 31(3), 343–351 (1983)

    MATH  Google Scholar 

  10. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thather, J.W. (eds.) Complexity of computer computations, pp. 85–104. Newyork Plenum Press (1972)

    Google Scholar 

  11. Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicast Routing for Multimedia Communications. IEEE/ACM Transactions on Networking 1(3), 286–292 (1993)

    Article  Google Scholar 

  12. Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. Acta Informatica 15, 141–145 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  13. Prim, R.C.: Shortest connection networks and some generalizations. Bell System Tech.J. 36, 1389–1401 (1957)

    Google Scholar 

  14. Ramanathan, S.: Multicast Tree Generation in Networks with Asymmetric Links. IEEE/ACM Transactions on Networking 4(4), 558–568 (1996)

    Article  MathSciNet  Google Scholar 

  15. Rodionov, A.S., Choo, H.: On generating random network structures: Trees. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol. 2658, pp. 879–887. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  16. 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 

  17. Rayward-Smith, V.J.: A Clare, On finding Steiner vertices. Networks 16(3), 283–294 (1986)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  19. Wang, B., Hou, J.C.: Multicast Routing and Its QoS Extension: Problems, Algorithms, and Protocols. IEEE Network 14(1), 22–36 (2000)

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Gunu Jho, Moonseong Kim & Hyunseung Choo

Authors
  1. Gunu Jho
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Moonseong Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hyunseung Choo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer and Communication Engineering, University of Thessaly, Glavani 37, 382 21, Volos, Greece

    Panayiotis Bozanis

  2. Department of Computer and Communication Engineering, University of Thessaly, 382 21, Volos, Greece

    Elias N. Houstis

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jho, G., Kim, M., Choo, H. (2005). Source-Based Minimum Cost Multicasting: Intermediate-Node Selection with Potentially Low Cost. In: Bozanis, P., Houstis, E.N. (eds) Advances in Informatics. PCI 2005. Lecture Notes in Computer Science, vol 3746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11573036_77

Download citation

  • DOI: https://doi.org/10.1007/11573036_77

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-32091-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation