QoS Multicast Routing Based on Ant Algorithm in Internet

被引:2
作者
LU Guo ying LIU Ze min School of Telecommunication Engineering Beijing University of Posts and TelecommunicationsBeijing PRChina [100876 ]
机构
关键词
<Keywords>multicast; ant algorithm; optimization; pheromone table; internet;
D O I
暂无
中图分类号
TP393 [计算机网络];
学科分类号
081201 ; 1201 ;
摘要
In this paper, based on ant algorithm, we propose a QoS multicast routing scheme in Internet. We first describe ant algorithm model and give ant network model, then present an approach using ant algorithm to optimize the multicast routes with QoS constaints. Finally, simulations has been made to show the efficiency of the approach in the environment of OPNET simulation software, and the simulation results show that the proposed approach can find the best optimal multicast routes which can satisfy the delay bounded requirement and avoid congested nodes as soon as possible.
引用
收藏
页码:12 / 17
页数:6
相关论文
共 2 条
[1]   A FAST ALGORITHM FOR STEINER TREES [J].
KOU, L ;
MARKOWSKY, G ;
BERMAN, L .
ACTA INFORMATICA, 1981, 15 (02) :141-145
[2]  
Data networks(2nd ed). BERTSEKAS D, GALLAGER R G. Prentice-Hall . 1992