期刊文献+

光网络中一种部分SRLG分离路由方法

An algorithm of partial SRLG-disjoint diverse routing in optical network
下载PDF
导出
摘要 利用SRLG失效对网络最大流的消减程度来评价SRLG重要性的方法,提出基于重要性的部分SRLG分离算法MIDR。仿真对比分析MIDR算法和保护路优先算法,MIDR算法使整个网络能为更多的业务提供服务,降低网络的阻塞率。 This paper proposes a heuristic method, called the Multiple Importance Diverse Routing (MIDR), which can find two approximately SRLG-disjoint paths in WDM mesh networks. Comparisons are made between MIDR and the Active Path First (APF) algorithm. Simulation results show that MIDR can effectively reduce the required spare capacity and enhance the network resources utilization.
出处 《光通信技术》 CSCD 北大核心 2008年第8期11-14,共4页 Optical Communication Technology
基金 陕西省教育厅科技专项基金(07JK332 08JK386)资助 西安理工大学校基金(105-210715)资助
关键词 光网络 共享风险链路组 保护 分离式路由 optical network shared risk link group(SRLG) protection diverse routing
  • 相关文献

参考文献8

  • 1PAPADIMITRIOU D, POPPE F, JONES J, et al ,Inference of shared risk link groups, optical Internetworking Forum [C]. OIF contribution Oil2001-066, July 2001.
  • 2XU D H, XIONG Y Z, QIAO C M, et al. Trap avoidance and protection schemes in networks with shared risk link groups [J]. IEEE/OSA Journal of Lightwave Technology, 2003, 21(11):2683-2693.
  • 3HU J Q. Diverse routing in optical mesh networks[J]. IEEE Transaction on Communications, 2003, 51 (3):489-494,networks, IEEE Communications Letter, 2002, 6:406-408.
  • 4DATTA P, SOMANI A K. Diverse routing for Shared Risk Resource Groups (SRRG's) in WDM optical networks [C]. In Proceedings of First International Conference on Broadband Networks, 2004:120-129.
  • 5WEN H,LI L. A routing algorithm for finding low-cost pair of no-shared-risk paths[C]. In Proceedings of SCI'02, 2002(x):430-434.
  • 6XU D,XIONG Y,QIAO C, et al. Failure protection in layered networks with shared risk link groups[J]. IEEE Network, 2004, 18(3):36-41.
  • 7SHEN L,YANG X,RAMAMURTHY B. Shared risk link group (SRLG) -diverse path provisioning under hybrid service level agreements in wave- length-routed optical mesh networks [J]. IEEE/ACM Transactions on Networking, 2005, 13(4):918-931.
  • 8HOPCROFT J E, RICHARD M K. An n5/2 algorithmfor maximumn matchings in bipartite graphs [J]. SIAM Joumalon Computing, 1973, 2(4): 225-231.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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