The heuristics for the constrained multicast routing

  • Zong-Ben Xu
  • Bo-Ting Yang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1179)


We present in this paper heuristics for the multicast routing problem in communications. Two constraints are considered, namely, the end-to-end delay along the path from the source to any destination is bounded, and the total cost of the edges associated with the problem-defining graph is minimized. It is shown by computer simulation that our proposed heuristics perform significantly better than that of a previous method [8].


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R.K.Ahuja,T.L.Magnanti and J.B.Orlin, “Network Flows-Theory, Algorithms and Applications,” Prentice Hall, Englewood Cliffs, New Jersey, 1993.Google Scholar
  2. 2.
    E.W.Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, Vol.1, pp.269–271, 1959.CrossRefGoogle Scholar
  3. 3.
    R.W.Floyd, “Algorithm 97: Shortest parths,” Commun. ACM, Vol.5, pp.345, 1962.CrossRefGoogle Scholar
  4. 4.
    H.Fukuoka and T.Oda, “Optimal routing for point to multipoint communications,” IEICE Trans., Vol.E74-B-I, pp.10–19, 1991.Google Scholar
  5. 5.
    X.F.Jiang, “Routing broadband Multicast streams,” Computer Communications, Vol.15, pp.45–51, 1992.CrossRefGoogle Scholar
  6. 6.
    R.M.Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations, R.E.Miller and J.W.Thatcher,Eds. New York,1972, pp.85–103.Google Scholar
  7. 7.
    B.N.Khoury, P.M.Pardalos and D.Z.Du, “A test problem generator for the Steiner problem in graphs,” ACM Transactions on Mathematical Software, Vol.19, pp.509–522, 1993.CrossRefGoogle Scholar
  8. 8.
    V.P.Kompella, J.C.Pasquale and G.C.Polyzos, “Multicast Routing for Multimedia Communication,” IEEE/ACM Transactions on Networking, Vol.1, pp.286–292, 1993.CrossRefGoogle Scholar
  9. 9.
    K.J.Lee, A.Gersht and A.Friedman, “Multipoint connection routing,” International Journal of Digital and Analog communication systems, Vol.7, pp.177–186, 1990.Google Scholar
  10. 10.
    X.L.Lin and L.M.Ni, “Multicast communication in multicomputer networks,” IEEE Transactions on Parallel and Distributed Systems, Vol.4, pp.1105–1117, 1993.CrossRefGoogle Scholar
  11. 11.
    Y.Tanaka and P.C.Huang, “Multiple destination routing algorithms,” IEICE Trans. Communications, Vol.E78-B, pp.544–552, 1993.Google Scholar
  12. 12.
    H.Tode, Y.Sakai,M.Yamamoto,H.Okada and Y.Tezuka, “Traffic distributing algorithm for multicast routing in packet type networks,” IEICE Trans., Vol.E74, pp.4051–4059, 1991.Google Scholar
  13. 13.
    D.C.Verma and P.M.Gopal, “Routing reserved bandwidth multipoint Connections,” Computer Communication Review, Vol.23, pp.96–105, 1993.CrossRefGoogle Scholar
  14. 14.
    B.M.Waxman, “Routing of multi-point Connections,” IEEE J. on Select Areas in Communications, Vol.6, pp.1617–1622, 1988.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Zong-Ben Xu
    • 1
  • Bo-Ting Yang
    • 1
  1. 1.Faculty of ScienceXi'an Jiaotong UniversityXi'anChina

Personalised recommendations