WDM網(wǎng)狀網(wǎng)中基于共享風(fēng)險鏈路組限制的業(yè)務(wù)量疏導(dǎo)算法
Traffic Grooming for Survivable WDM Mesh Networks under Shared-Risk-Link-Group Constraints
-
摘要: 該文研究了業(yè)務(wù)量疏導(dǎo)WDM網(wǎng)狀網(wǎng)中如何建立可靠的業(yè)務(wù)連接問題，提出一種新的基于共享風(fēng)險鏈路組(SRLG)限制的共享通路保護(hù)算法。該算法既可以保證用戶業(yè)務(wù)不同的可靠性要求，同時又能夠有效提高全網(wǎng)的資源利用率，從而大大降低全網(wǎng)的業(yè)務(wù)阻塞率。該文還對所提算法進(jìn)行了仿真研究，并給出了仿真結(jié)果。Abstract: This paper addresses the dynamic establishment of dependable connections for grooming WDM mesh networks. A shared path-protection algorithm under Shared Risk Link Group(SRLG) constraints for multi-granularity traffic is proposed. The presented scheme establishes SRLG-disjoint primarily and backups traffic stream paths between the source-destination node pairs and reduces the spare capacity. It provides the same level of protection against single SRLG failure as dedicated path-protection scheme. Moreover it is better than dedicated path-protection scheme in network utilization. Network performance, based on dynamic traffic with different load, is investigated via simulations. The results show that the scheme can improve the performance of the network significantly.
-
計量
- 文章訪問數(shù): 2506
- HTML全文瀏覽量: 157
- PDF下載量: 784
- 被引次數(shù): 0
下載:
