The heuristics for the constrained multicast routing
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 .
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- 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
- 11.Y.Tanaka and P.C.Huang, “Multiple destination routing algorithms,” IEICE Trans. Communications, Vol.E78-B, pp.544–552, 1993.Google Scholar
- 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