抗毀WDM網(wǎng)中單SRLG故障的共享子通路保護(hù)
A Shared Sub-path Protection for a Single SRLG Failure in Survivable WDM Networks
-
摘要: 該文針對抗毀WDM網(wǎng)中單個(gè)共享風(fēng)險(xiǎn)鏈路組(Shared Risk Link Group,SRLG)故障,提出了一種動態(tài)共享子通路保護(hù)(Dynamic Shared Sub-Path Protection,DSSPP)算法.DSSPP為每條業(yè)務(wù)請求選擇一條工作通路后,按照參數(shù)m把工作通路劃分成若干條等長的子通路,其中m為子通路的長度,并為每條子通路各選擇一條SRLG分離的保護(hù)通路.如果兩條子通路SRLG分離,則它們對應(yīng)的保護(hù)通路可以共享相同資源.在進(jìn)行路由選擇時(shí),DSSPP考慮了負(fù)載均衡度和資源共享度,因此能有效地提高資源利用率和降低業(yè)務(wù)阻塞率.仿真表明,DSSPP不僅能保護(hù)單SRLG故障,而且能靈活地在資源利用率(阻塞率)和保護(hù)切換時(shí)間之間進(jìn)行性能折衷.Abstract: This paper proposes an algorithm, called Dynamic Shared Sub-Path Protection (DSSPP), for protecting a single Shared Risk Link Group (SRLG) failure in survivable WDM mesh networks. DSSPP firstly searches a primary path for a connection request, and it follows to segment the primary path into several equal length sub-paths according to the m, where the m is the length of the sub-path, and searches a SRLG-disjoint backup path for each sub-path. If two sub-paths are SRLG-disjoint, then their corresponding backup paths can share the common resources. When computing paths, DSSPP considers the load balance and the resources sharing degree, so that the paths are the minimum cost, and the resource utilization ratio can be improved and the blocking ratio can be reduced. The simulation results show that DSSPP not only can completely protect a single-SRLG failure but also can make the trade-offs between the resource utilization ratio (or blocking ratio) and the protection-switching time.
-
Ramamurthy S, Sahasrabuddhe L, Mukherjee B. Survivable WDM mesh networks[J].Journal of Lightwave Technology.2003,21(4):870-[2]Jozsa B G, Orincsay D, Kern A. Surviving multiple network failures using shared backup path protection. in Proc. of the IEEE International Symposium on Computers and Communication, Turkey, 2003, 2:1333 - 1340.[3]He W S, Somani A K. Path-based protection for surviving double-link failures in mesh-restorable optical networks. in Proc.of the IEEE Conference on Global Telecommunications, Hong Kong, China, 1-5 Dec. 2003, 5:2558 - 2563.[4]Papadimitriou D, Poppe F, Jones J, et al.. Inference of shared risk link groups, Internet Draft, draft-many-inference-srlg-00.txt, Feb.2001.[5]溫海波,王晟,李樂民.一種不共享風(fēng)險(xiǎn)的雙路徑選路算法[J].電子與信息學(xué)報(bào).2003,25(6):824-830瀏覽[6]何榮希,張治中,王晟,等.IP/MPLS over WDM網(wǎng)中基于共享風(fēng)險(xiǎn)鏈路組限制的共享通路保護(hù)算法,電子學(xué)報(bào),2002,30(11):1638-1642.[7]Guo L, Yu H F, Li L M. Joint routing-selection algorithm for a shared-path with differentiated reliability in survivable wavelength-division-multiplexing mesh networks[J].Opt. Express.2004, 12 (11):2327-[8]何榮希,王晟,李樂民.光網(wǎng)絡(luò)中支持多粒度的子通路保護(hù)算法.電子科技大學(xué)學(xué)報(bào),2003,32(3):245-250.[9]何榮希,王光興.WDM疏導(dǎo)網(wǎng)絡(luò)中的子通路保護(hù)算法.東北大學(xué)學(xué)報(bào),2003,24(7):647-650.[10]郭磊,虞紅芳,李樂民.WDM網(wǎng)狀網(wǎng)中一種動態(tài)共享子路徑保護(hù)算法.第九界全國青年通信學(xué)術(shù)會議,重慶,2004:597-603. -
計(jì)量
- 文章訪問數(shù): 2390
- HTML全文瀏覽量: 118
- PDF下載量: 576
- 被引次數(shù): 0
下載:
