网状WDM网中的共享通路保护设计算法  

Shared-Path Protection Design Algorithm for Meshed WDM Network

作　　者：虞红芳[1] 王晟[1] 李乐民[1] 

机构地区：[1]电子科技大学宽带光纤传输与通信系统技术重点实验室,四川成都610054

出　　处：《电子学报》2004年第4期635-638,共4页Acta Electronica Sinica

基　　金：国家自然科学基金(No.60002004;No.60302010);电子科技大学校青年基金(No.YF020102);教育部科学技术研究重点项目(No.02064)

摘　　要：本文研究了网状WDM网中的SRLG(Shared Risk Link Groups:共享风险链路组)分离约束下的静态共享通路保护设计问题-给定网络物理拓扑、业务量需求矩阵和工作路由,为每个波长需求确定保护路由,使得所需的备份资源最小.这个问题可以用整数线形规划公式来描述.由于这是一个NP-C问题,因此,本文提出一种启发式算法MSC(Maximally Share the Capacity)加以解决,该算法的核心思想是改变链路权重使得保护路由之间尽量共享资源.仿真结果表明,本文算法能有效地降低所需的备份资源,提高了网络的资源利用率.The paper considers the static shared-path protection problem under SRLG (Shared Risk Link Groups) constraint in meshed WDM networks-determining the backup route for each wavelength demand to minimize spare capacity required, given the network topology, traffic matrix and primary routes of all demand. This problem can be formulated as Integer Linear Programming, a NP-C problem, which is computationally intractable for large size of networks. So, we present a heuristic algorithm to address the problem. The key idea of the algorithm is to maximally share the capacity. Simulation results show that the developed scheme effectively reduces the required spare capacity arid enhances the network resources utilization.

关 键 词：网状WDM网 SRLG分离 共享通路保护 备份资源 启发式算法 

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