一种新的WDM网状网中的动态子通路保护算法  

A New Dynamic Sub-path Protection Algorithm for WDM Mesh Networks

作　　者：孙永飞[1] 高随祥[1] 张百成[1] 王蔚[1] 

机构地区：[1]中国科学院研究生院,北京100039

出　　处：《计算机工程与应用》2006年第17期136-138,173,共4页Computer Engineering and Applications

摘　　要：论文研究了业务量疏导WDM网状网中的生存性问题,提出一种新的基于优先级的自适用子通路保护算法(PASPP)。该算法在为子通路寻找保护通路时,高优先级业务可以通过抢占低优先级的业务保护通路来提高其连通率,而同时对低优先级业务也能提供部分保护。仿真结果表明,该算法有较好的性能。In Wavelength Division Multiplexing （ WDM ） optical networks, lightpaths are high-capacity all-optical channels.A single fiber failure can lead to the failure of all the lightpaths traversing the fiber,and results in significant loss of traffic.Therefore,effective survivability mechanism is needed to minimize the data loss.This paper proposes a new Adaptive Sub-Path Protection Based on Priority（PASPP） algorithm for WDM mesh networks with traffic grooming capability.The idea of PASPP is the high priority traffic can snatch the low priority tmffic＇s protection path to reduce the blocking probability when computing the protection path of the sub-path,at one time,it can provide part protection to the low priority traffic.The simulation shows that PASPP has good performance.

关 键 词：业务量疏导 通路保护 优先级 WDM网络 算法 

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