| 一种新的基于自适应蚁群算法的QOS单播路由策略 |
| |
| 引用本文： | 林晖,郑荣,万晓瑜,樊自甫. 一种新的基于自适应蚁群算法的QOS单播路由策略[J]. 微计算机应用, 2007, 28(4): 386-389 |
| |
| 作者姓名： | 林晖 郑荣 万晓瑜 樊自甫 |
| |
| 作者单位： | 1. 重庆邮电学院,下一代网络研究所,重庆,400065;福建师范大学,数学与计算机科学学院,福州,350007
2. 重庆邮电学院,下一代网络研究所,重庆,400065 |
| |
| 基金项目： | 重庆市教委资助项目;重庆市教委资助项目 |
| |
| 摘 要： | 分析现有的路由策略的不足的基础上，提出了一种基于自适应的蚁群算法的新的路由策略，该策略将蚁群算法、带宽和时延波动约束控制结合控制路由选择，仿真结果表明该策略与Static Routing和Session Routing相比具有更优的时延和丢包率。能够有效的提高网络的服务质量。
|
| 关 键 词： | 蚁群算法 路由策略 |
| 修稿时间： | 2005-11-15 |
A New Policy of QOS Unicast Routing Based on the Adaptive Ant System |
| |
| LIN Hui,ZHENG Rong,WAN Xiaoyu,FAN Zifu. A New Policy of QOS Unicast Routing Based on the Adaptive Ant System[J]. Microcomputer Applications, 2007, 28(4): 386-389 |
| |
| Authors: | LIN Hui ZHENG Rong WAN Xiaoyu FAN Zifu |
| |
| Affiliation: | 1.ChongQing University Of Posts And Telecommunications, Congqing ,400065, China; 2 .Department of Computer Science, Fujian Normal University, Fuzhou,350007, China |
| |
| Abstract: | Ant colony algorithm is one kind of new - type heuristically optimizing , based on ant colony systematic policy , having ability to organize itself. In order to solve the problem that QOS route meets while studying at present ,this paper utilizes the characteristic of ant colony systematic policy that can look for the shortest - path , and proposes an new policy of QOS unicast routing based on ant colony systematic principles ,and used for solving delay and drop. the emulation results prove that this policy is effective ,adaptive , robust , expansible. |
| |
| Keywords: | QOS |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
