業(yè)務量疏導WDM網狀網中的動態(tài)子通路保護算法
Dynamic Sub-path Protection Algorithm for WDM Mesh Networks with Traffic Grooming Capabilities
-
摘要: 該文研究了業(yè)務量疏導WDM網狀網中的生存性問題，提出一種自適應子通路保護(ASPP)算法。該算法根據網絡當前狀態(tài)以及到達業(yè)務連接請求的帶寬要求動態(tài)調整鏈路權值；在此基礎上選擇一條最短路作為工作通路，然后將該通路分為互不重疊的n段子通路(每段經過的鏈路數為m)，并分別找出各自的保護通路。仿真結果表明：ASPP既可以保證業(yè)務連接的可靠性要求，同時又允許網絡管理者根據一定優(yōu)化策略調整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.
-
計量
- 文章訪問數: 2258
- HTML全文瀏覽量: 98
- PDF下載量: 743
- 被引次數: 0
下載:
