Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (2)
  • 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

    CMC-Computers, Materials & Continua, Vol.76, No.1, pp. 561-572, 2023, DOI:10.32604/cmc.2023.033332

    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… More >

  • Open Access

    ARTICLE

    Ant Colony Optimization for Multi-Objective Multicast Routing

    Ahmed Y. Hamed1, Monagi H. Alkinani2, M. R. Hassan3, *

    CMC-Computers, Materials & Continua, Vol.63, No.3, pp. 1159-1173, 2020, DOI:10.32604/cmc.2020.09176

    Abstract In the distributed networks, many applications send information from a source node to multiple destination nodes. To support these applications requirements, the paper presents a multi-objective algorithm based on ant colonies to construct a multicast tree for data transmission in a computer network. The proposed algorithm simultaneously optimizes total weight (cost, delay and hop) of the multicast tree. Experimental results prove the proposed algorithm outperforms a recently published Multi-objective Multicast Algorithm specially designed for solving the multicast routing problem. Also, it is able to find a better solution with fast convergence speed and high reliability. More >

Displaying 1-10 on page 1 of 2. Per Page