基于负载均衡的SRLG共享保护通路算法  

Load equalization-based SRLG sharing protection path algorithm

作　　者：韦艳霞[1] 

机构地区：[1]广西工学院信息与计算科学系,广西柳州545006

出　　处：《广西工学院学报》2008年第4期80-82,共3页Journal of Guangxi University of Technology

基　　金：广西工学院硕士基金项目资助(编号:070234)

摘　　要：研究了动态业务下自动交换光网络(ASON)的生存性,针对ASON中共享风险链路组(SRLG)故障,提出了一种基于负载均衡的SRLG共享保护通路算法(LE-SSPP)。算法调整链路的代价,采用最短路径算法找出K条SRLG分离的最短路径,选择代价(cost)和跳数(hops)最小的路径作为保护通路。仿真表明,LE-SSPP不仅能够有效的均衡负载,降低业务阻塞率,而且能满足资源利用率与故障恢复速度折衷的要求。We focus on the survivability of the Automatic Switched Optical Network （ASON） under dynamic service, propose load equalization-based SRLG sharing protection path algorithm （LE-SSPP） for Shared Risk Link Group （SRLG） failures in ASON. This algorithm firstly adjusts the cost of links, then adopts the shortest-path algorithm to find out K SRLG-disjointed shortest paths, at last chooses the least cost and hops as the protection path. The simulation results show that LE-SSPP not only balance the load effectively, reduce blocking ratio but also meet the network demand of balance between the resource utilization and failure recovery speed.

关 键 词：共享风险链路组 负载均衡 生存性 算法 

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