| Pheromone-Based Ant Routing System for IP Networks |
| |
| 引用本文： | 张林 任勇 山秀明. Pheromone-Based Ant Routing System for IP Networks[J]. 清华大学学报, 2004, 9(2): 213-218 |
| |
| 作者姓名： | 张林 任勇 山秀明 |
| |
| 作者单位： | DepartmentofElectronicEngineering,TsinghuaUniversity,Beijing100084,China |
| |
| 基金项目： | Supported by the Tsinghua ?85?Innovation Foundation，the Na-tional Natural Science Foundation of China(Nos. 60202010 and 90204004)，and the National High-Tech Research and Develop-ment (863) Program of China (No. 2001AA121062) |
| |
| 摘 要： | The pheromone-based ant routing algorithm is a distributed routing algorithm with good scalability and robustness. A 2-D cellular automata (CA) model of the computer network was presented to analyze the algorithm. The results show that the procedure of establishing a stable route is self-organized towards the attractive peculiar state, and the duration of time for the routing establishment is power-law distributed. A practical ant routing protocol over an IP network was also presented, and two simulations were done to compare the performance dynamic and the load balancing performance between this protocol and the open shortest path first (OSPF) protocol. The results show that the ant routing protocol out-performs OSPF in these aspects.
|
| 关 键 词： | 蚂蚁路由协议 自组织 最短路径优先协议 IP网 二维细胞自动机模型 服务质量 |
Pheromone-Based Ant Routing System for IP Networks |
| |
| ZHANG Lin,REN Yong,SHAN Xiuming. Pheromone-Based Ant Routing System for IP Networks[J]. Tsinghua Science and Technology, 2004, 9(2): 213-218 |
| |
| Authors: | ZHANG Lin REN Yong SHAN Xiuming |
| |
| Affiliation: | ZHANG Lin,REN Yong,SHAN Xiuming Department of Electronic Engineering,Tsinghua University,Beijing 100084,China |
| |
| Abstract: | The pheromone-based ant routing algorithm is a distributed routing algorithm with good scalability and robustness. A 2-D cellular automata (CA) model of the computer network was presented to analyze the algorithm. The results show that the procedure of establishing a stable route is self-organized towards the attractive peculiar state, and the duration of time for the routing establishment is power-law distributed. A practical ant routing protocol over an IP network was also presented, and two simulations were done to compare the performance dynamic and the load balancing performance between this protocol and the open shortest path first (OSPF) protocol. The results show that the ant routing protocol out-performs OSPF in these aspects. |
| |
| Keywords: | routing power-law distribution self-organization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
