On Multicasting with Minimum Costs for the Internet Topology
We have developed and evaluated a novel heuristic algorithm for the construction of a multicast tree with minimizing tree costs. Our algorithm works on directed asymmetric networks and is shown here to have a perform gain in terms of tree costs for Internet like networks over existing algorithms. The time complexity of our algorithm is O(Dxm for a m-arc network with D number of members in the multicast group and is comparable to well-known algorithms for multicast tree construction. We have performed empirical evaluation that compares our algorithms with the others on large networks.
KeywordsRandom Graph Random Network Steiner Tree Multicast Tree Multicast Group
Unable to display preview. Download preview PDF.
- 1.Ravindra K. Ajuja, Thomas L. Magnanti, and James B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, 1993.Google Scholar
- 3.M. R. Garey and D. S. Johnson, it Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., San Francisco, 1979.Google Scholar
- 5.B. K. Kadaba and J. M. Jaffe, Routing to multiple destinations in computer networks, IEEE Transactions on Communications, COM-31, no. 3, pp. 343–351, 1983.Google Scholar
- 10.B. M. Waxman, Routing of multipoint connections, IEEE Journal on Selected Areas in Communications, vol. 6, no. 9, 1988.Google Scholar
- 12.Ellen W. Zegura, Kenneth L. Calvert, and Michael J. Donahoo, A Quantitative Comparison of Graph-based Models for Internet Topology, IEEE/ACM Transactions on networking, vol. 5, no. 6, 1997.Google Scholar
- 13.Q. Zhu, M. Parsa, and J. J. Garcia-Luna-Aceves, A source-based algorithm for delay constrained minimum-cost multicasting, Proceedings of INFOCOM, pp. 377–385, 1995.Google Scholar