Open Access
ARTICLE
Generation of Low-Delay and High-Stability Multicast Tree
Deshun Li1, Zhenchen Wang2, Yucong Wei2, Jiangyuan Yao1,*, Yuyin Tan2, Qiuling Yang1, Zhengxia Wang1, Xingcan Cao3
1 School of Computer Science and Technology, Hainan University, Haikou, Hainan, 570228, China
2 School of Cyberspace Security (School of Cryptology), Hainan University, Haikou, Hainan, 570228, China
3 Faculty of Arts, University of British Columbia, Vancouver, V6T1Z4, Canada
* Corresponding Author: Jiangyuan Yao. Email:
Computers, Materials & Continua 2023, 76(1), 561-572. https://doi.org/10.32604/cmc.2023.033332
Received 14 June 2022; Accepted 30 January 2023; Issue published 08 June 2023
Abstract
Delay and stability are two key factors that affect the performance of multicast data transmission in a network. However, current algorithms of tree generation hardly meet the requirements of low delay and high stability simultaneously. Given a general network, the generation algorithm of a multicast tree with minimum delay and maximum stability is an NP-hard problem, without a precise and efficient algorithm. To address these challenges, this paper studies the generation of low-delay and high-stability multicast trees under the model of spanning tree based on stability probability, degree-constrained, edge-weighted for multicast (
T-SDE). A class of algorithms was proposed which creates the multicast tree greedy on the ratio of fan-out to delay (
RFD) and probability of stability of terminal to obtain a high performance in multicast. The proposed algorithms greedily select terminals with a large
RFD and a high probability of stability as forwarding nodes in the generation of the multicast tree, where the larger
RFD and higher stability of upstream nodes are beneficial to achieve a low transmission delay and high stability in multicast. The proposed
RFD can be compatible with the original model, which can take advantage of network connectivity during the generation of a multicast tree. This paper carries out simulation experiments on Matlab R2016b to measure the performance of the proposed algorithm. Experimental results show that the proposed algorithm can provide a smaller height, higher stability, and a lower transmission delay of the resulting multicast tree than other solutions. The spanning tree of the proposed algorithms can support low transmission delay and high stability in multicast transmission.
Keywords
Cite This Article
APA Style
Li, D., Wang, Z., Wei, Y., Yao, J., Tan, Y. et al. (2023). Generation of low-delay and high-stability multicast tree. Computers, Materials & Continua, 76(1), 561-572. https://doi.org/10.32604/cmc.2023.033332
Vancouver Style
Li D, Wang Z, Wei Y, Yao J, Tan Y, Yang Q, et al. Generation of low-delay and high-stability multicast tree. Comput Mater Contin. 2023;76(1):561-572 https://doi.org/10.32604/cmc.2023.033332
IEEE Style
D. Li et al., "Generation of Low-Delay and High-Stability Multicast Tree," Comput. Mater. Contin., vol. 76, no. 1, pp. 561-572. 2023. https://doi.org/10.32604/cmc.2023.033332