| SDH虚级联中的最优化路径选择 |
| |
| 引用本文： | 徐跃刚,韩大海,张杰,顾畹仪. SDH虚级联中的最优化路径选择[J]. 北京邮电大学学报, 2007, 29(1): 58-61 |
| |
| 作者姓名： | 徐跃刚 韩大海 张杰 顾畹仪 |
| |
| 作者单位： | 北京邮电大学,电信工程学院,北京,100876 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划)，国家自然科学基金 |
| |
| 摘 要： | 虚级联技术的同步数字体系（SDH）网络中，虚级联组成员的选路将是一个完全非确定多项式（NP-complete）问题．为优化网络资源以及保证新加虚级联组的成员的相对延迟在系统允许的范围内，提出了双向约束路径优化算法（TSOP）．仿真结果表明, 该算法优于已有的k个最短路径算法和可改链路权重的k个最短路径算法．
|
| 关 键 词： | 链路容量调整方案 虚级联 双向约束路径优化算法 |
| 文章编号： | 1007-5321（2007）01-0058-04 |
| 收稿时间： | 2006-01-12 |
| 修稿时间： | 2006-01-12 |
Optimal Path Selection for Virtual Concatenation in SDH Networks |
| |
| XU Yue-gang,HAN Da-hai,ZHANG Jie,GU Wan-yi. Optimal Path Selection for Virtual Concatenation in SDH Networks[J]. Journal of Beijing University of Posts and Telecommunications, 2007, 29(1): 58-61 |
| |
| Authors: | XU Yue-gang HAN Da-hai ZHANG Jie GU Wan-yi |
| |
| Affiliation: | School of Telecommunication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China |
| |
| Abstract: | The path selection for members of virtual concatenation group is non-deterministic polynomial(NP) complete problem in synchronous digital hierarchy(SDH) networks applying virtual concatenation technology.Two-sided constrained optimal path(TSOP) algorithm was proposed to maintain high utilization of network resources and ensure the new adding VC-n to satisfy the differential delay constraints.Simulations results showed the performance of TSOP algorithm is superior to those of k-shortest path algorithm and modified-link-weight k-shortest path algorithm. |
| |
| Keywords: | link capacity adjustment scheme virtual concatenation two-sided constrained optimal path algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《北京邮电大学学报》浏览原始摘要信息 |
|
点击此处可从《北京邮电大学学报》下载全文 |
