| RPR高生存性网络的约束路由算法的研究 |
| |
| 引用本文： | 熊志新,楚纪正. RPR高生存性网络的约束路由算法的研究[J]. 光通信技术, 2009, 33(6) |
| |
| 作者姓名： | 熊志新 楚纪正 |
| |
| 作者单位： | 北京化工大学,信息科学与技术学院,北京,100029 |
| |
| 摘 要： | 在分析RPR高生存性网络的拓扑结构的特性基础上,引进了约束路由算法的概念,并且提出了一种以跨环次数和跳数为约束条件的最短路径的路由选择算法.通过网络仿真工具OPNET仿真验证,结果表明该算法在网络时延方面有一定优越性.
|
| 关 键 词： | 弹性分组环 约束路由算法 OPNET仿真 |
Study on constraint routing algorithm of RPR-based high survivability network |
| |
| XIONG Zhi-xin,CHU Ji-zheng. Study on constraint routing algorithm of RPR-based high survivability network[J]. Optical Communication Technology, 2009, 33(6) |
| |
| Authors: | XIONG Zhi-xin CHU Ji-zheng |
| |
| Affiliation: | XIONG Zhi-xin,CHU Ji-zheng (College of Information Science and Technology,Beijing University of Chemical Technology,Beijing 100029,China) |
| |
| Abstract: | In this paper,we analyze a muti-ring topology structure of RPR high survivability network.Based on the special topology structure,we introduce the concept of constraint routing algorithm and get a shortest path routing algorithm which take number of cross-ring and number of hop as the constraint condition.Using the network simulation software OPNET,we can get the results which show that the algorithm have a certain su- periority in delaying in the network. |
| |
| Keywords: | RPR constraint routing algorithm simulation of OPNET |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
