To solve multicast routing under multiple constraints, it is required to generate a multicast tree that ranges from a source to the destinations with minimum cost subject to several constraints. In this paper, PSO has been embedded with BFO to improve the convergence speed and avoid premature convergence that will be used for solving QoS multicast routing problem. The algorithm proposed here generates a set of delay compelled links to every destination present in the multicast group. Then the Bacteria Foraging Algorithm (BFA) selects the paths to all the destinations sensibly from the set of least delay paths to construct a multicast tree. The robustness of the algorithm being proposed had been established through the simulation. The efficiency and effectiveness of the algorithm being proposed was validated through the comparison study with other existing meta-heuristic algorithms. It shows that our proposed algorithm IBF-PSO outperforms its competitive algorithms.


    Access

    Download


    Export, share and cite



    Title :

    The Multi-Constrained Multicast Routing Improved by Hybrid Bacteria Foraging-Particle Swarm Optimization


    Contributors:

    Publication date :

    2019-06-19


    Remarks:

    doi:10.7494/csci.%Y.%v.%i.3131
    Computer Science; Vol. 20 No. 2 ; 2300-7036 ; 1508-2806


    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629



    Improved multi-objective particle swarm optimization algorithm

    Baoning, L. / Weiguo, Z. / Guangwen, L. et al. | British Library Online Contents | 2013


    A Novel Particle Swarm Optimization for Multi-Objective Vehicle Routing Problem

    Guo, Sen / Qin, Guihe / Zhang, Jindong et al. | British Library Online Contents | 2016


    Penyelesaian Permasalahan Multi-tour Inventory Routing Problem dengan Particle Swarm Optimization

    Budiman, Syarif Daniel / Widyadana, I Gede Agus | BASE | 2013

    Free access