业务量疏导WDM网状网中的动态子通路保护算法
Dynamic Sub-path Protection Algorithm for WDM Mesh Networks with Traffic Grooming Capabilities
-
摘要: 该文研究了业务量疏导WDM网状网中的生存性问题,提出一种自适应子通路保护(ASPP)算法。该算法根据网络当前状态以及到达业务连接请求的带宽要求动态调整链路权值;在此基础上选择一条最短路作为工作通路,然后将该通路分为互不重叠的n段子通路(每段经过的链路数为m),并分别找出各自的保护通路。仿真结果表明:ASPP既可以保证业务连接的可靠性要求,同时又允许网络管理者根据一定优化策略调整m值,从而可以在资源利用率和恢复时间之间进行折中。Abstract: 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 an Adaptive Sub-Path Protection (ASPP) algorithm for WDM mesh networks with traffic grooming capabilities. The idea of ASPP is to segment each working path into several equal length sub-paths, and to compute their protection paths respectively. Based on dynamic traffic with different load, the performance of ASPP has been compared with traditional protection approaches via simulations. The results show that ASPP can make the tradeoffs between the resource utilization and recovery times.
计量
- 文章访问数: 2251
- HTML全文浏览量: 96
- PDF下载量: 743
- 被引次数: 0