期刊文献+

WDM网状网中基于共享风险链路组限制的业务量疏导算法 被引量:3

Traffic Grooming for Survivable WDM Mesh Networks under Shared-Risk-Link-Group Constraints
下载PDF
导出
摘要 该文研究了业务量疏导WDM网状网中如何建立可靠的业务连接问题,提出一种新的基于共 享风险链路组(SRLG)限制的共享通路保护算法。该算法既可以保证用户业务不同的可靠性要求,同时又 能够有效提高全网的资源利用率,从而大大降低全网的业务阻塞率.该文还对所提算法进行了仿真研究,并 给出了仿真结果。 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.
出处 《电子与信息学报》 EI CSCD 北大核心 2004年第4期549-555,共7页 Journal of Electronics & Information Technology
基金 国家自然科学基金(69973011 60002004和69990540) 中国博士后科学基金(2003033031)资助项目
关键词 WDM 网状网 共享风险链路组 业务量疏导 共享通路保护 波分复用 Wavelength-Division Multiplexing (WDM), Mesh network, Share Risk Link Group (SRLG), Traffic grooming, Shared path-protection
  • 相关文献

参考文献8

  • 1Zhu K, Mukherjee B. On-line approaches for provisioning connections of different bandwidth granularities in WDM mesh networks [C]. Proc. of IEEE/OSA OFC'02, Anaheim, CA, Mar.2002: 549-551.
  • 2Zhu K, Mukherjee B. Traffic grooming in an optical WDM mesh network [J]. IEEE J. on SAG,2002, 20(1): 122-133.
  • 3Thiagarajan S, Somani A. Capacity fairness of WDM networks with grooming capabilities [J].Optical Network Mag., 2001, 2(3): 24-32.
  • 4Dutta R, Rouskas G. On optimal traffic grooming in WDM rings [J]. IEEE J. on SAC, 2002,20(1): 110-121.
  • 5Thiagarajan S, Somani A. Traffic grooming for survivable WDM mesh networks [J]. Optical Network Mag., 2002, 3(3): 88-98.
  • 6Ramamurthy S, Mukherjee B. Survivable WDM mesh networks, Part I-Protection [C]. Proc. of IEEE INFOCOM'99, New York, NY, Mar. 1999, Vol.2: 744-751.
  • 7Poppe F, et al.. Inference of Shared Risk Link Groups [EB/OL]. Internet Draft, Work in Progress,Feb. 2001. http://www.watersprings.org/links/mlr/id/draft-many-inference-srlg-00.txt.
  • 8Li G, et al.. Efficient distributed path selection for shared restoration connections [C]. Proc. of IEEE INFOCOM'02, New York, NY, June 2002. http://www.ieee-infocom.org/2002/papers/466.pdf.

同被引文献15

  • 1黄善国,罗沛,薄明霞,顾畹仪.WDM网状网中的动态流量疏导策略[J].北京邮电大学学报,2006,29(2):26-29. 被引量:4
  • 2Gerstel O,Ramaswami R.Optical layer survivability:a services perspective[J].IEEE Comm.Mag.,2000,38(3):104-113.
  • 3Bhatia R S,Kodialam M,Lakshman T V.Bandwidth guaranteed routing with fast restoration against link and node failures[J].IEEE/ACM Transactions on Networking,2008,16(6):1321-1330.
  • 4Chen B S,Rouskas G N,Dutta R.On hierarchical traffic grooming in WDM networks[J].IEEE/ACM Transactions on Networking,2008,16(6):1226-1238.
  • 5Zhu K,Zhu H,Mukherjee B.Traffic engineering in multi-granularity heterogeneous optical WDM mesh networks through dynamic traffic grooming[J].IEEE/ACM Transactions on Network,2007,17(2):8-15.
  • 6Zhu H,Zang H,Zhu K,et al.A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks[J].IEEE/ACM Transactions on Networking,2003,11(2):285-299.
  • 7Zhu H,Zhu K,Zang H,et al.Cost-effective WDM backbone network design with OXCs of different bandwidth granularities.IEEE[J].Journal on Selected Areas in Communications,2003,21(9):1452-1466.
  • 8Xin C S.Dynamic traffic grooming in optical networks with wavelength conversion[J].IEEE Journal on Selected Areas in Communications,2007,25(9):50-57.
  • 9Zeng Hong-qing,Huang Chang-cheng,Vukovic A.Span-ning-tree based monitoring-cycle construction for fault detection and localization in mesh AONs[M].Proceedings of IEEE ICC'05.Seoul:IEEE Press,2005:1726-1730.
  • 10温海波.WDM网状网中的业务量疏导算法[D].成都:电子科技大学,2003:24-25.

引证文献3

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部