Advertisement

On Multicasting with Minimum Costs for the Internet Topology

  • Young-Cheol Bang
  • Hyunseung ChooEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2400)

Abstract

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.

Keywords

Random Graph Random Network Steiner Tree Multicast Tree Multicast Group 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ravindra K. Ajuja, Thomas L. Magnanti, and James B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, 1993.Google Scholar
  2. 2.
    F. Bauer and A. Varma, Distributed algorithms for multicast path setup in data networks, IEEE/ACM Transations on Networking, vol. 4, no. 2, pp. 181–191, 1996.CrossRefGoogle Scholar
  3. 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
  4. 4.
    F. K. Hwang and D. Richards, Steiner tree probkems, Networks, vol. 22, pp. 55–89, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 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
  6. 6.
    V. P. Kompella, J. C. Pasquale, and G. C. Polyzoa, Multicast routing fo rmulti-media communications, IEEE/ACM Transations on Networking, vol. 1, no. 3, pp. 286–292, 1993.CrossRefGoogle Scholar
  7. 7.
    L. Kou, G. Markowsky, and L. Berman, A fast algorithm for steiner trees, Acta Informatica, vol. 15, pp. 145–151, 1981.CrossRefMathSciNetGoogle Scholar
  8. 8.
    S. Ramanathan, Multicast tree generation in networks with asymetric links, IEEE/ACM Transations on Networking, vol. 4, no. 4, pp. 558–568, 1996.CrossRefMathSciNetGoogle Scholar
  9. 9.
    H. Takahashi and A. Matsuyama, An Approximate Solution for the Steiner Problem in Graphs, Mathematica Japonica, vol. 24, no. 6, pp. 573–577, 1980.zbMATHMathSciNetGoogle Scholar
  10. 10.
    B. M. Waxman, Routing of multipoint connections, IEEE Journal on Selected Areas in Communications, vol. 6, no. 9, 1988.Google Scholar
  11. 11.
    P. Winter, Steiner problem in networks, Networks, vol. 17, pp. 129–167, 1987.zbMATHCrossRefMathSciNetGoogle Scholar
  12. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  1. 1.Department of Computer EngineeringKorea Polytechnic UniversityKyunggi-DoKorea
  2. 2.School of Electrical and Computer EngineeringSungkyunkwan UniversitySuwonKorea

Personalised recommendations