業(yè)務(wù)量疏導(dǎo)WDM網(wǎng)狀網(wǎng)中的動態(tài)子通路保護(hù)算法
Dynamic Sub-path Protection Algorithm for WDM Mesh Networks with Traffic Grooming Capabilities
-
摘要: 該文研究了業(yè)務(wù)量疏導(dǎo)WDM網(wǎng)狀網(wǎng)中的生存性問題，提出一種自適應(yīng)子通路保護(hù)(ASPP)算法。該算法根據(jù)網(wǎng)絡(luò)當(dāng)前狀態(tài)以及到達(dá)業(yè)務(wù)連接請求的帶寬要求動態(tài)調(diào)整鏈路權(quán)值；在此基礎(chǔ)上選擇一條最短路作為工作通路，然后將該通路分為互不重疊的n段子通路(每段經(jīng)過的鏈路數(shù)為m)，并分別找出各自的保護(hù)通路。仿真結(jié)果表明：ASPP既可以保證業(yè)務(wù)連接的可靠性要求，同時又允許網(wǎng)絡(luò)管理者根據(jù)一定優(yōu)化策略調(diào)整m值，從而可以在資源利用率和恢復(fù)時間之間進(jìn)行折中。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.
-
計量
- 文章訪問數(shù): 2273
- HTML全文瀏覽量: 103
- PDF下載量: 746
- 被引次數(shù): 0
下載:
