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
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bauer, F., Varma, A.: Distributed Algorithms for Multicast Path Setup in Data Networks. IEEE/ACM Transactions on Networking 4(2), 181–191 (1996)
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)
Bertsckas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1992)
Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269–271 (1959)
Doar, M., Leslie, I.: How bad is naive multicast routing. In: Proceedings of the IEEE INFOCOM, pp. 82–89 (1993)
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)
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)
Hwang, F.K., Richards, D.: Steiner Tree Problems. Networks 22, 55–89 (1992)
Kadaba, B.K., Jaffe, J.M.: Routing to Multiple Destinations in Computer Networks. IEEE Transactions on Communications, COM-31 31(3), 343–351 (1983)
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)
Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicast Routing for Multimedia Communications. IEEE/ACM Transactions on Networking 1(3), 286–292 (1993)
Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. Acta Informatica 15, 141–145 (1981)
Prim, R.C.: Shortest connection networks and some generalizations. Bell System Tech.J. 36, 1389–1401 (1957)
Ramanathan, S.: Multicast Tree Generation in Networks with Asymmetric Links. IEEE/ACM Transactions on Networking 4(4), 558–568 (1996)
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)
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)
Rayward-Smith, V.J.: A Clare, On finding Steiner vertices. Networks 16(3), 283–294 (1986)
Takahashi, H., Matsuyama, A.: An Approximate Solution for the Steiner Problem in Graphs. Mathematica Japonica 24(6), 573–577 (1980)
Wang, B., Hou, J.C.: Multicast Routing and Its QoS Extension: Problems, Algorithms, and Protocols. IEEE Network 14(1), 22–36 (2000)
Waxman, B.M.: Routing of multipoint connections. IEEE Journal on Selected Areas in Communications 6(9), 1617–1622 (1988)
Winter, P.: Steiner Problem in Networks: A Survey. Networks 17, 129–167 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)