Abstract
Group multicast routing problem (GMRP) is a generalization of multicasting whereby every member of the group is allowed to multicast messages to other members from the same group. The routing problem in this case involves the construction of a set of low cost multicast trees with bandwidth requirements for all the group members in the network. The traditional solutions only care for the low cost of multicast trees and sometimes the algorithms will fail during the construction due to the inefficiency of the bandwidth allocation. In this paper we study the feasible solutions to GMRP by proposing a new algorithm to improve the success rate of constructing multicast trees. Simulation results show that our new algorithm performed better in terms of bandwidth utilization and success rate of building multicast trees compared with existing algorithms.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Ballardie T, Francis P., Crowcroft J., “Core Based Trees (CBT)”, Proc. SIGCOMM’ 93 Conf., ACM, (1993) 85–95.
F. Bauer. A. Varma. “Distributed algorithms for multicast path setup in data networks”, IEEE/ACM Trans. Networking 4(2), (1996) 181–191.
Dirceu Cavendish, Aiguo Fei, Mario Gerla and Raphael Rom, “On the construction of low cost Multicast Trees with Bandwidth Reservation”, UCLA Technical Report, Doc ID: ncstrl.ucla_cs/970043.
M.R. Garey, D.S. Johnson, “Computers and Intractability—a Guide to the Theory of NP-completeness”, Freeman, New York, 1979.
X. Jia and L. Wang, “Group multicast routing algorithm by using multiple minimum Steiner trees”, Computer Communications 20, (1997) 750–758.
R. M. Karp, “Reducibility among Combinatorial Problems” in Miller and Thatcher (Eds.), complexity of Computer Computations, Plenum Press. New York, 1972, 85–103.
V. P. Kompella, J. C. Pasquale, G. C. Polyzos. “Multicast routing for multimedia communication”, IEEE/ACM Tran. On Networking 1(3), (June 1993) 286–292.
L. Kou, G. Markowsky and L. Berman, “A fast algorithm for Steiner trees”, Acta Informatica 15, (1981) 141–145.
C. P. Low, N. Wang “An efficient algorithm for group multicast routing with bandwidth reservation”, Proc. IEEE International conf. on networks (ICON’99).
V.J. Rayward-Smith and A. Clare, “On Finding Steiner Vertices”, Networks, Vol. 16, no. 3, (1986), 283–294.
H. Takahashi and A. Matsuyama, “An approximate solution for the Steiner problem in graphs”, Math. Japonica 6, (1980) 573–577.
B. M. Waxman, “Routing of multipoint connections”, IEEE J. Selected Areas Commun. 6(9) (1988) 1617–1622.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, N., Low, C.P. (2000). On Finding Feasible Solutions to the Group Multicast Routing Problem. In: Pujolle, G., Perros, H., Fdida, S., Körner, U., Stavrakakis, I. (eds) Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks. NETWORKING 2000. Lecture Notes in Computer Science, vol 1815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45551-5_19
Download citation
DOI: https://doi.org/10.1007/3-540-45551-5_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67506-8
Online ISBN: 978-3-540-45551-6
eBook Packages: Springer Book Archive