WDM网状网中基于树路由的鲁棒抗毁算法研究  

Robust survivability design of WDM mesh networks using tree routing

作　　者：戴睿[1] 李乐民[1] 王晟[1] 

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

出　　处：《计算机应用研究》2009年第12期4652-4655,共4页Application Research of Computers

基　　金：国家"973"计划资助项目(2007CB307104);国家自然科学基金资助项目(90604002);国家教育部计划资助项目(NCET-05-0807)

摘　　要：研究了波分复用(WDM)网状网在软管不确定业务量模型下的鲁棒抗毁问题,提出一种新的基于树路由机制的共享分段保护算法——TSSP(tree-based shared-segment protection)算法。利用软管模型下树路由机制的基本特征,TSSP算法首先计算出一个具有最小叶子节点数的工作树,然后根据恢复时间的要求为树上所有的叶子节点对寻找保护路径,最后借助共享保护的思想进行波长配备,从而达到优化网络性能的目的。仿真结果表明,相对于现有的鲁棒抗毁算法,TSSP不仅具有较小的全网代价,其恢复速度也较快。This paper investigated the problem of robust survivability in WDM mesh networks under the hose uncertain traffic model, and proposed a novel shared-segment protection algorithm based on tree routing （called TSSP, Tree-based Shared-segment Protection）. Depending on the basic characteristics of the hose-model-based tree routing, the algorithm first computed a primary tree with the smallest number of leaf nodes, and then computed the backup paths for all the leaf node pairs of the tree according to the requirement of recovery time. Finally, it accomplished the wavelength provisioning in terms of shared-protection, so as to optimize the network performance. Simulation results show that TSSP not only achieves a low cost budget but also yields a fast recovery, in contrast to the existed robust protection algorithms.

关 键 词：波分复用网状网 软管不确定业务量模型 树路由 共享分段保护 

分 类 号：TN915[电子电信—通信与信息系统] TP393[电子电信—信息与通信工程]