| Ant Colony Algorithm for Solving QoS Routing Problem |
| |
| 作者姓名： | SUNLi-iuan WANGLiang-jun WANGRu-chuan |
| |
| 作者单位： | DepartmentofComputerScienceandTechnology,NanjingUniversityofPostsandTelecommunications,Nanjing210003,Jiangsu,China |
| |
| 基金项目： | SupportedbytheNationalNaturalScienceFoundationofChina(60 1 730 37and 70 2 71 0 50 )，theNaturalScienceFoundationof
JiangsuProvince(BK2 0 0 31 0 5) |
| |
| 摘 要： | Based on the state transition rule, the localupdating rule and the global updating rule of ant colony algorithm, we propose an improved ant colony algorithm of the least cost quality of service (QoS) unicast routing. The algorithm is used for solving the routing problem with delay, delay jitter, bandwidth, and packet loss-constrained. In the simulation, about 52.33% ants find the successful QoS routing , and converge to the best. It is proved that the algorithm is efficient and effective.
|
| 关 键 词： | 蚁群算法 服务质量 QoS 单一计算路由 计算机网络 |
| 收稿时间： | 9 April 2004 |
Ant colony algorithm for solving QoS routing problem |
| |
| SUNLi-iuan WANGLiang-jun WANGRu-chuan.Ant Colony Algorithm for Solving QoS Routing Problem[J].Wuhan University Journal of Natural Sciences,2004,9(4):449-453. |
| |
| Authors: | Sun Li-juan Wang Liang-jun Wang Ru-chuan |
| |
| Institution: | (1) Department of Computer Science and Technology, Nanjing University of Posts and Telecommunications, 210003 Najing, Jiangsu, China |
| |
| Abstract: | Based on the state transition rule, the local updating rule and the global updating rule of ant colony algorithm, we propose an improved ant colony algorithm of the least\|cost quality of service (QoS) unicast routing. The algorithm is used for solving the routing problem with delay, delay jitter, bandwidth, and packet loss\|constrained. In the simulation, about 52.33% ants find the successful QoS routing , and converge to the best. It is proved that the algorithm is efficient and effective. |
| |
| Keywords: | ant colony algorithm QoS unicast routing |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
