基于最短路径分割算法的SDH环网通路组织优化  

Optimized Passage Plan to SDH Ring Network Based on Shortest Path Splitting Loading Algorithm

作　　者：张勇[1,2] 周国祥[1] 石雷[1] 

机构地区：[1]合肥工业大学 [2]中国移动通信集团设计院有限公司安徽分公司合肥230031

出　　处：《电信工程技术与标准化》2007年第5期38-41,共4页Telecom Engineering Technics and Standardization

基　　金：安徽省自然科学基金资助;项目编号050420202。

摘　　要：针对SDH双向复用段保护环通路组织设计中存在的通路资源利用不充分及网络负载不平衡问题,本文提出一种基于最短路径分割的通路组织安排算法,该算法结合最短路径算法和平衡加载算法的优点,较好地满足了工程设计在经济性、安全性等方面的要求。本文最后实例中将该算法应用于SDH环网通路组织优化设计中,优化效果明显。In order to solve the problem of using the passage resource insufficiently and loading imbalance in passage plan of SDH bidirectional multiplexing section protection ring, a new passage plan algorithm based on shortest path splitting loading is presented in this paper. This algorithm combine advantage of shortest path loading algorithm with balance loading algorithm can satisfactorily meet the requirements of economical efficiency, security etc. in SDH network engineering design. By using the algorithm, an example optimizing SDH ring networks passage plan has achieved obvious effect.

关 键 词：光传输网络 SDH 通路组织设计 最短路径分割算法 

分 类 号：TN914.332[电子电信—通信与信息系统]