SDH虚级联中的最优化路径选择

Optimal Path Selection for Virtual Concatenation in SDH Networks

虚级联技术的同步数字体系(SDH)网络中,虚级联组成员的选路将是一个完全非确定多项式(NP-complete)问题.为优化网络资源,并保证新加虚级联组成员的相对延迟在系统允许的范围内,提出了双向约束路径优化算法(TSOP).仿真结果表明,该算法优于已有的k个最短路径算法和可改链路权重的k个最短路径算法.

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.