Abstract
The traditional idea of constructing an optimal group multicast tree (GMT) mainly adopted two-stage algorithm. The first stage constructed multiple single-source multicast trees (SMT), named the initial GMT, the second stage modified the initial GMT to obtain an optimal GMT. In this paper, we propose a new two-stage algorithm. Our algorithm adapt the second stage algorithm in two items. Firstly, for the purpose of quickly reducing the number of saturate links, we propose a new method of selecting the need-modified SMT. Next, aiming at minimizing the need-modified SMT’s cost and the number of the saturate links, we propose a dynamic modification algorithm using the existing topology of the SMT. Following that we combine the two steps into an entire iteration process. Our algorithm can significantly decrease the iteration number and can greatly reduce the computational time. Experimental results demonstrate that our algorithm has better performance than the previous two-stage algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Billhartz, T., Cain, J.B.: Performance and resource cost comparisons for the CBT and PIM multicast routing protocols. IEEE J. Sel. Areas Commun. 15(3), 304–315 (1997)
Jia, X.H., Wang, L.S.H.: A group multicast routing algorithm by using multiple minimum Steiner trees. Comput. Commun. 20, 750–758 (1997)
Wang, N., Low, C.P.: On finding feasible solutions to group multicast routing problem. IEICE Trans. Commun. E85-B(1), 268–277 (2002)
Din, D.-R.: Genetic algorithms for multiple multicast on WDM ring network. Comput. Commun. 27, 840–856 (2004)
Sanna Randaccio, L., Atzori, L.: Group multicast routing problem: a genetic algorithms based approach. Comput. Netw. 51(14), 3989–4004 (2007)
Xuan, M., Qing, L.: Particle swarm optimization for multiple multicast routing problem. J. Comput. Res. Dev. 50(2), 260–268 (2007)
Low, C.P., Wang, N.: An efficient algorithm for group multicast routing with bandwidth reservation. Comput. Commun. 23, 1740–1746 (2000)
Low, C.P., Song, X.Y.: On finding feasible solutions for the delay constrained group multicast routing problem. IEEE Trans. Comput. 51(5), 581–588 (2002)
Yan-lin, W.: Based QoS constrained group multicast routing for multimedia communication. In: International Conferrence on Computer, Mechatronics, Control and Electronics Engineering, pp. 296–299 (2010)
Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. Acta Informatica 15(2), 141–145 (1981)
Takahashi, H., Matsuyama, A.: An approximate solution for the Steiner problems in graphs. Math. Japonica 6, 573–577 (1980)
Waxman, B.M.: Routing of multipoint connections. IEEE J. Sel. Areas Commun. 6(9), 1617–1622 (1988)
Acknowledgments
This work was supported by the National Natural Science Foundation of China under Grant No. 61472230, and the Shandong provincial Natural Science Foundation of China under Grant Nos. ZR2014YL042, ZR2015FL025 and ZR2016YL008.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Sun, M., Zhang, X., Zhang, J. (2018). A New Two-Stage Algorithm for Constructing Group Multicast Tree with Bandwidth Constraint. In: Barolli, L., Woungang, I., Hussain, O. (eds) Advances in Intelligent Networking and Collaborative Systems. INCoS 2017. Lecture Notes on Data Engineering and Communications Technologies, vol 8. Springer, Cham. https://doi.org/10.1007/978-3-319-65636-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-65636-6_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-65635-9
Online ISBN: 978-3-319-65636-6
eBook Packages: EngineeringEngineering (R0)