首页 | 本学科首页   官方微博 | 高级检索  
     

WDM网状网中基于共享风险链路组限制的业务量疏导算法
引用本文:何荣希, 温海波, 王光兴, 李乐民. WDM网状网中基于共享风险链路组限制的业务量疏导算法[J]. 电子与信息学报, 2004, 26(4): 549-555.
作者姓名:何荣希  温海波  王光兴  李乐民
作者单位:东北大学信息科学与工程学院,沈阳,110004;电子科技大学宽带光纤传输与通信系统技术国家重点实验室,成都,610054;电子科技大学宽带光纤传输与通信系统技术国家重点实验室,成都,610054;东北大学信息科学与工程学院,沈阳,110004
基金项目:国家自然科学基金(69973011,60002004和69990540),中国博士后科学基金(2003033031)资助项目
摘    要:该文研究了业务量疏导WDM网状网中如何建立可靠的业务连接问题,提出一种新的基于共享风险链路组(SRLG)限制的共享通路保护算法。该算法既可以保证用户业务不同的可靠性要求,同时又能够有效提高全网的资源利用率,从而大大降低全网的业务阻塞率。该文还对所提算法进行了仿真研究,并给出了仿真结果。

关 键 词:波分复用   网状网   共享风险链路组   业务量疏导   共享通路保护
文章编号:1009-5896(2004)04-0549-07
收稿时间:2002-10-30
修稿时间:2002-10-30

Traffic Grooming for Survivable WDM Mesh Networks under Shared-Risk-Link-Group Constraints
He Rong-xi, Wen Hai-bo, Wang Guang-xing, Li Le-min. Traffic Grooming for Survivable WDM Mesh Networks under Shared-Risk-Link-Group Constraints[J]. Journal of Electronics & Information Technology, 2004, 26(4): 549-555.
Authors:He Rong-xi  Wen Hai-bo  Wang Guang-xing  Li Le-min
Affiliation:School of Information Sci. & Eng.,Northeastern University Shenyang 110004 China;Nat. Key. Lab of Broadband Opt. Fiber Transm. and Comm. Networks UEST of China Chengdu 610054
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.
Keywords:Wavelength-Division Multiplexing (WDM)   Mesh network   Share Risk Link Group (SRLG)   Traffic grooming   Shared path-protection
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号