一种新的QoS组播路由算法

针对现有的求解多约束QoS组播路由中存在的问题,结合BP神经网络局部搜索的优势和蚁群算法全局搜索的优势的特点,进行QoS组播路由算法的设计,提出了一种新型的NNAC算法。该算法通过BP神经网络寻找路径的更优解,改善了QoS组播路由路径寻找的方法。通过实验仿真表明,NNAC算法得到最优组播树的总延时为35,总代价费用为21,在完成150个度约束组播路由路径时,NNAC算法在进行最优组播树的寻找成功率上高于AC算法,同时该算法还克服了AC算法易陷入局部最小点的不足。

A new algorithm of QoS multicast routing

Aiming at solving QoS multicast routing problem, we combine the advantages of BP neural network at local search and ant colony algorithm at global search, designing the QoS multicast routing algorithm. This paper presents a new NNAC algorithm. The algorithm by BP neural network to find a better path, improved QoS multicast routing path finding method. Simulation results indicate that, the total delay of the NNAC algorithm to get the optimal multicast tree is 35, the total cost is 21. On the completion of the 150 degree constrained multicast routing path, the NNAC algorithm in the optimal multicast tree search success rate is higher than that of AC algorithm. While the algorithm overcomes the AC algorithm is easy to fall into local minimum point defects.