期刊文献+

WDM网络中基于p-path和p-cycle的混合保护方案

P-path and p-cycle-based hybrid protection scheme for WDM networks
原文传递
导出
摘要 为设计一种针对光网络中单链路失效的波长资源利用率高的快速保护算法,该文分析了完全预配置保护对预配置结构的约束,对比了预配置保护环(p-cycle)和预配置保护通道(p-path)保护性能,提出了p-cycle和p-path混合配置保护方案。该方案按比例选取p-cycle和p-path作为预配置结构,通过求解整数线性规划(ILP)方程得到优化配置方案。使用COST 239网络拓扑进行的仿真实验表明:相同网络负载和波长资源条件下,p-cycle和p-path混合保护方案比p-cycle独立保护方案的网络冗余度可以优化10%,同时保留了p-cycle快速保护的优点。 A fast protection scheme with low redundancy is needed for single link failures in wavelength-division multiplexing (WDM) optical networks. This paper analyzes the restriction of perfect pre-configured protection on pre-configured structures and then theoretically compares the protection offered by the pre-configured protection cycle (p-cycle) and that of the pre-configured protection path (p-path). A hybrid fast protection scheme was then developed which mixes the p-path and p-cycle. This scheme selects p-cycles and p-paths in various proportions as pre-configured structures for near optimal configurations by solving an integer linear programming (ILP) problem. Simulation results with the COST 239 topology show that this hybrid protection scheme provides 10% better in network redundancy than a pure p-cycle scheme. Meanwhile, it retains the merits of the p-cycle for fast protection.
出处 《清华大学学报(自然科学版)》 EI CAS CSCD 北大核心 2007年第1期40-44,共5页 Journal of Tsinghua University(Science and Technology)
关键词 光纤通信 保护 波分复用(WDM) 预配置保护环(p—cycle) 预配置保护通道(p—path) optical communication protection wavelength division multiplexing (WDM) pre-configured protection cycle (p-cycle) pre-configured protection path (p-path)
  • 相关文献

参考文献8

  • 1Grover W D.Mesh-based Survivable Networks Options and Strategies for Optical,MPLS,SONET,and ATM Networking[M].New Jersey:Prentice Hall PTR,2004.
  • 2Stamatelakis D.Theory and Algorithms for Pre-configuration of Spare Capacity in Mesh Restorable Networks[D].Alberta:University of Alberta,1997.
  • 3Schupke D A,Gruber C,Autenrieth A.Optimal configuration of p-cycles in WDM networks[C] //Proceedings of IEEE ICC'02.New York:IEEE Press,2002:2761-2765.
  • 4Grover W D,Doucette J E.Advances in optical network design with p-cycles:Joint optimization and pre-selection of candidate p-cycles[C] //Proceedings of the IEEE-LEOS Summer Topical Meeting on All Optical Networking.Mont Tremblant,Quebec:July 15-17,2002:49-50.
  • 5Johnson D B.Finding All the Elementary circuits of a directed graph[J].SIAM J on Computing,1975,4:77-84.
  • 6Grover W D.Self-healing Networks-A Distributed Algorithm for k-Shortest Link-Disjoint Paths in a Multigraph with Applications in Realtime Network Restoration[D].Alberta:University of Alberta,1989.
  • 7Gruber C G.Deployment of p-Cycles in WDM Networks[D].Munich:Institute of Communication Networks,Technical University of Munich,2001.
  • 8ZHANG Zhenrong,ZHONG Wende,Mukherjee B.A heuristic method for design of survivable WDM networks with p-cycles[J].IEEE Communications Letters,2004,8(7):467-469.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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