| WDM光网络中一种不共享风险的路由算法 |
| |
| 引用本文： | 周韬,郭磊,虞红芳,李乐民.WDM光网络中一种不共享风险的路由算法[J].电子科技大学学报（自然科学版）,2006,35(4):440-442,453. |
| |
| 作者姓名： | 周韬 郭磊 虞红芳 李乐民 |
| |
| 作者单位： | 1.电子科技大学通信与信息工程学院 成都 610054 |
| |
| 摘 要： | 在共享风险链路组的约束下,提出了一种共享路径的联合路由算法。该算法使用一种新的K对路由来选择最小代价的工作路由和风险分离的保护路由对。仿真表明,该算法能启发式地接近最佳性能,并能在资源利用率、阻塞率和保护切换时间之间进行性能折中。
|
| 关 键 词： | WDM光网络 共享风险链路组 共享路径保护 K对路由 |
| 收稿时间： | 2004-06-24 |
| 修稿时间： | 2004-06-24 |
A Routing Algorithm with No-Shared-Risk for WDM Optical Networks |
| |
| ZHOU Tao,GUO Lei,YU Hong-fang,LI Le-min.A Routing Algorithm with No-Shared-Risk for WDM Optical Networks[J].Journal of University of Electronic Science and Technology of China,2006,35(4):440-442,453. |
| |
| Authors: | ZHOU Tao GUO Lei YU Hong-fang LI Le-min |
| |
| Affiliation: | 1.School of Communication and Information Engineering,Univ. of Electron. Sci. & Tech. of China Chengdu 610054 |
| |
| Abstract: | This paper proposes a Joint Routing Algorithm (JRA) for shared-path under Shared Risk Link Group (SRLG) constraints. JRA uses a novel K-Paths-Pairs (KPP) routing to select the minimum cost primary and SRLG-disjoint backup paths pair for each connection request. Under dynamic traffic with different load, the performances of JRA have been investigated via simulations. The results show that JRA not only can near the optimal performances but also can make the tradeoffs between the resource utilization ratio (or blocking ratio) and the protection-switching time. |
| |
| Keywords: | WDM optical networks shared risk link group shared-path protection K-paths-pairs routing |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《电子科技大学学报（自然科学版）》浏览原始摘要信息 |
|
点击此处可从《电子科技大学学报（自然科学版）》下载全文 |
