基于最少转接多权值SDH传送网通道路由算法  

Multi-weight path routing algorithm of SDH transport network based on principle of the least jumper wire operations

作　　者：刘会永[1] 孟洛明[1] 

机构地区：[1]北京邮电大学网络与交换技术国家重点实验室,北京100876

出　　处：《通信学报》2006年第3期37-43,共7页Journal on Communications

基　　金：国家自然科学基金资助项目(90204002)~~

摘　　要：为提高SDH传送网通道开通的效率,提供多个选路原则下的路径解集,对传送网的通道路由搜索方法进行了研究。提出了一种基于最少转接次数原则且提供多权值路径解集的算法。引入转接距离概念,根据与起点的转接次数不同划分网络中的节点为若干集合,简化网络的拓扑结构。定义了计算转接距离集合的运算,对运算结果进行深度优先遍历,得到最少转接的多权值路径解集。对算法的正确性和特点作了分析,并对算法进行了举例说明。To improve the efficiency of establishing channels, and provide multiple path sets of diverse routing principles, path muting algorithm of SDH networks was discussed. A novel algorithm based on principle of the least jumper wire operations was proposed. Because a connection passed more than one system need jumper wire operations by DXC（digital cross connect） or manually, the less systems mean the greater efficiency, For representing jumper times, a concept of ＂jumper distance＂ was defined, and rules of calculating distance sets were given. Through them, network nodes were clarified as several jumper distance sets, and the network topology was simplified. By applying DFS（depth-first search） to distance sets, path muting results could be obtained. An application in an example network was introduced, which shows the algorism is of great value.

关 键 词：SDH传送网 通道路由算法 最少转接次数 多权值 

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