A new QoS Multicast routing algorithm using ant algorithm

被引：0
作者：
Gong, Bencan [1 ]
Li, Layuan [1 ]
机构：
[1] Wuhan Univ Technol, Dept Comp Sci & Technol, Wuhan 430063, Peoples R China
来源：
DCABES 2007 PROCEEDINGS, VOLS I AND II | 2007年
关键词：
QoS; multicast routing; ant algorithm; state transition rule; pheromone updating rule;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
QoS Multicast routing has been a very important research issue in the areas of network and distributed system. In this paper, we propose a new QoS multicast routing algorithm (NQMRA). The traditional ant algorithm is improved to be suitable for QoS routing problem. Firstly the crossover operation of genetic algorithm is used to optimize the solution and quicken the convergence. In addition, we modify the state transition rule and pheromone updating rule of ant algorithm to effectively guide ants' movement and ensure the feasibility of a solution. Simulation results show that NQMRA can find the optimal or sub-optimal solution quickly and is a feasible approach to QoS multicast routing.
引用
收藏
页码：210 / 214
页数：5
相关论文
共 14 条
[1]  
CARBERG K, 1997, ACM COMPUTER COMMUNI, P5
[2]  
Dorigo M., 1997, IEEE Transactions on Evolutionary Computation, V1, P53, DOI 10.1109/4235.585892
[3]   A FAST ALGORITHM FOR STEINER TREES [J].
KOU, L ;
MARKOWSKY, G ;
BERMAN, L .
ACTA INFORMATICA, 1981, 15 (02) :141-145
[4]  
Li Layuan, 2004, Journal of Systems Engineering and Electronics, V15, P90
[5]  
LI LY, 2002, NETWORKS, P37
[6]  
LI LY, 1989, P IEEE INFOCOM APR, P74
[7]   Multicast routing based on ant algorithm for delay-bounded and load-balancing traffic [J].
Lu, GY ;
Liu, ZM ;
Zhou, Z .
25TH ANNUAL IEEE CONFERENCE ON LOCAL COMPUTER NETWORKS - PROCEEDINGS, 2000, :362-368
[8]  
QING Z, 1995, P IEEE INFOCOM 95
[9]  
Sun Q., 1995, P 2 WORKSH PROT MULT, P452
[10]   Ant colony optimization for multicast routing [J].
Wang, Y ;
Xie, JY .
2000 IEEE ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS: ELECTRONIC COMMUNICATION SYSTEMS, 2000, :54-57
12