Abstract
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].
The work was supported by the Kokusai Denshiu Denwa Company, Ltd., Japan. The work was done while the author visited the Department of Mechanical and Automation Engineering, The Chinese University of Hong Kong.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R.K.Ahuja,T.L.Magnanti and J.B.Orlin, “Network Flows-Theory, Algorithms and Applications,” Prentice Hall, Englewood Cliffs, New Jersey, 1993.
E.W.Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, Vol.1, pp.269–271, 1959.
R.W.Floyd, “Algorithm 97: Shortest parths,” Commun. ACM, Vol.5, pp.345, 1962.
H.Fukuoka and T.Oda, “Optimal routing for point to multipoint communications,” IEICE Trans., Vol.E74-B-I, pp.10–19, 1991.
X.F.Jiang, “Routing broadband Multicast streams,” Computer Communications, Vol.15, pp.45–51, 1992.
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.
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.
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.
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.
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.
Y.Tanaka and P.C.Huang, “Multiple destination routing algorithms,” IEICE Trans. Communications, Vol.E78-B, pp.544–552, 1993.
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.
D.C.Verma and P.M.Gopal, “Routing reserved bandwidth multipoint Connections,” Computer Communication Review, Vol.23, pp.96–105, 1993.
B.M.Waxman, “Routing of multi-point Connections,” IEEE J. on Select Areas in Communications, Vol.6, pp.1617–1622, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, ZB., Yang, BT. (1996). The heuristics for the constrained multicast routing. In: Jaffar, J., Yap, R.H.C. (eds) Concurrency and Parallelism, Programming, Networking, and Security. ASIAN 1996. Lecture Notes in Computer Science, vol 1179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027793
Download citation
DOI: https://doi.org/10.1007/BFb0027793
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62031-0
Online ISBN: 978-3-540-49626-7
eBook Packages: Springer Book Archive