Abstract
Nowadays, the network is expected to service much more multimedia data with the improvement of the network communication bandwidth and development of the processing capacity. In the multicasting communication system, once every receiving end separately sends the data packets, the network resources intend to be wasted, and the calculating stress on the nodes is also going to be increased. A distributed delay-restricted multicast route heuristic method DMPH (delay-constrained minimal-cost path heuristic) is presented in this article. This algorithm proposed in the article can achieve a convergence speed, back up dynamic multicast, and offer the pretty good the network overhead performance. In order to gain the better performance of the network cost, the article firstly proposes a mathematical topological model of the problem over the delay-constrained multicast routing, and then presents a dynamic multicast delay-restricted multicast route algorithm which is called DMPH (Delay-Constrained Minimal-Cost Path Heuristic), fast-convergent and distributed. The computing simulation results suggest that the method pro-posed can gain the better performance of the network cost. In addition, the article just addressed the operation of the addition and quit of the nodes on the dynamic varying of the multicast group, but not concerned the over-head optimal. These problems mentioned above are all our future research work.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
\( P(d_{i} ,T) \) It can be calculated from a delay-limited unicast routing algorithm, which does not mean absolute optimization.
- 2.
Inform contains T2D and a message informing T2D [di]. tree node to establish a minimum overhead path to node di that satisfies the delay.
- 3.
Route: to look for a multicast routing tree initiated from a source node that covers all destination nodes;
- 4.
Connection Configuration: New connections are configured for each node on the tree, including reserving network resources and registering a new connections in a switching table.
References
Lee, S.-J., Su, W., Gerla, M.: On-demand multicast routing protocol in multi hop wireless mobile networks. Mob. Netw. Appl. 7, 441–453 (2002)
Wang, J., Zhengpeng, Y., Gillbanks, J., Sanders, T.M., Zou, N.: A power control algorithm based on chicken game theory in multi-hop networks. Symmetry 11(5), 718 (2019)
Sahasrabuddhe, L.H., Mukherjee, B.: Multicast routing algorithms and protocols: a tutorial. IEEE Netw. 1(2), 90–102 (2000)
Lee, S.-J., Su, W., Gerla, M.: Ad hoc wireless multicast with mobility prediction.: Book title. In: Proceedings of IEEE ICCCN 1999, no. 7, pp. 4–9 (1999)
Wang, J., Zhang, S., Zhang, J.: Multi-hop maimal ratio combining (MHMRC) diversity based on virtual cellular network. Jilin Univ. 41, 533–536 (2011)
Wang, J., Zou, N., Zhang, Y., Li, P.: Study on downlink performance of multiple access algorithm based on antenna diversity. ICIC Express Lett. 9, 1221–1225 (2015)
Acknowledgements
This research was financially supported via Project of the National Natural Science Foundation of China (61402069), the 2017 Project of the Natural Science Foundation of Liaoning province (20170540059), the General project of Liaoning education department in 2016 (2016J205).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Wang, J., Guan, X., Zhou, Y., Cao, F., Zou, N. (2020). A Multicast Routing Algorithm Under the Delay-Restricted Network Environment. In: Jiang, X., Li, P. (eds) Green Energy and Networking. GreeNets 2020. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 333. Springer, Cham. https://doi.org/10.1007/978-3-030-62483-5_35
Download citation
DOI: https://doi.org/10.1007/978-3-030-62483-5_35
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-62482-8
Online ISBN: 978-3-030-62483-5
eBook Packages: Computer ScienceComputer Science (R0)