| 基于生长竞争蚁群算法的QoS路由算法* |
| |
| 引用本文： | 朱刚,马良.基于生长竞争蚁群算法的QoS路由算法*[J].计算机应用研究,2010,27(11):4076-4077. |
| |
| 作者姓名： | 朱刚 马良 |
| |
| 作者单位： | 1. 上海第二工业大学电子与电气工程学院,上海,201209
2. 上海理工大学管理学院,上海,200093 |
| |
| 基金项目： | 国家自然科学基金资助项目(70871081)；上海市重点学科建设资助项目(S30504)；上海市教育委员会重点学科建设项目(J51801) |
| |
| 摘 要： | 为解决多约束QoS单播路由问题，提出一种基于改进蚁群算法的QoS单播路多目标算法。该算法引入生长竞争机制,使算法尽可能向Pareto最优靠近。实验结果表明,该算法是可行和有效的,能够在资源预留的基础上较好地满足用户对带宽和时延的要求。
|
| 关 键 词： | 生长竞争蚁群算法 单播路由 服务质量 多目标 |
QoS routing algorithm based on growing competitive ant algorithm |
| |
| ZHU Gang,MA Liang.QoS routing algorithm based on growing competitive ant algorithm[J].Application Research of Computers,2010,27(11):4076-4077. |
| |
| Authors: | ZHU Gang MA Liang |
| |
| Affiliation: | (School of Electrical & Electronic Engineering, East China Jiaotong University, Nanchang 330013, China) |
| |
| Abstract: | For solving the multiple constrained QoS unicast routing problem, this paper proposed a multi-objective algorithm for QoS routing based on improved ant algorithm.This algorithm used a rule of growing competitive in order to approach to Pareto optimal. The experimental results illustrate that the algorithm is feasible and effective, and it can satisfy the need of the user for bandwidth and delay on the basic of resource reservation. |
| |
| Keywords: | growing competitive ant algorithm unicast routing quality of service multi-objective |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
