期刊文献+

抗毁性WDM网状光网络中的p圈快速构造算法(英文)

Novel algorithm of finding good candidate pre-configuration cycles in survivable WDM mesh network
下载PDF
导出
摘要 p圈法是抗毁性网状WDM光网络中一种十分优秀的保护算法,在p圈配置到网状光网络的过程中,圈构造算法是设计的第一步。文中提出了一种快速圈挖掘算法(FCMA),本算法基于k-最短路由算法构造最小p圈,通过圈扩展算法获得更多性能优良圈,文中给了启发式算法的具体步骤。通过计算机仿真表明,该算法实现快速圈构造,性能优于其它同类算法,适合网状光网络中的p圈快速构造。 A fast and reliable recovery system is essential in survivability design of Wavelength-division-multiplexing (WDM) mesh networks. The Pre-configuration cycle design benefits both the fast recovery time and the efficient resource utilization. In this paper, a novel algorithm of finding cycles is presented, called the Fast Cycles Mining Algorithm (FCMA), for efficient p-cycle network design in WDM networks. The algorithm is also flexible because the number and the length of cycles generated are controlled by several input parameters. This algorithm is scalable and especially suitable tbr survivable WDM mesh networks. Finally, the performance of the algorithm is gauged by running on some real world network topologies.
出处 《光电工程》 EI CAS CSCD 北大核心 2007年第4期94-99,共6页 Opto-Electronic Engineering
关键词 波长分割多嘴复用 光网络 P圈 快速挖掘算法 圈构造 Wavelength division multiplexing Opticalnetwork P-cycle Finding cycles Fast cycles mining algorithm
  • 相关文献

参考文献9

  • 1GROVER W.D,STAMATELAKIS D.Cycle-oriented Distributed Preconfiguration:Ring-like Speed with Mesh-like Capacity for Self-planning NetworkRestoration[A].In Proc.of IEEE ICC 1998[C].[sl]:[sn],1998.537-543.
  • 2JOHNSON D.B.Finding All the Elementary Circuits of a Directed Graph[J].SIAM J.on Computing,1975,4:77-84.
  • 3ZHANG H,YANG O.Finding Protection Cycles in DWDM Networks[A].Proc.of IEEE ICC 2002[C].[sl]:[sn],2002.2756-2760.
  • 4Chang LIU,Lu RUAN.Finding Good Candidate Cycles for Efficient p-Cycle Network Design[A].in Proc.of IEEE ICCCN 2004[C].[sl]:[sn],2004.321-326.
  • 5DOUCETTE J,HE D,GROVER W.D,et al.Algorithmic Approaches for Efficient Enumeration of Candidate p-Cycles and Capacitated p-Cycle Network Design[A].in Proc.Of DRCN 2003[C].[sl]:[sn],2003.212-220.
  • 6MACGREGOR M.H,GROVER W.D.Optimized K-shortest Paths Algorithm for Facility Restoration[J].Software-Practice & Experience,1994,24:823-834.
  • 7GROVER W.D,DOUCETTE J.E.Advances in Optical Network Design with p-Cycles:Joint Optimization and Pre-selection of Candidate p-Cycles[A].in Proc.of the IEEE-LEOS Summer Topical Meeting on All Optical Networking[C].[sl]:[sn],2002.WA2-49-WA2-50.
  • 8LISTANTI M,BERDUSCO M,SABELLA R.Optical Path Strategies in WDM All-optical Networks:Minimization of Wavelength Converters in Optical Cross-connect[A].in Proc.of IEEE GLOBECOM'97[C].[sl]:[sn],1997.S16.7.
  • 9BATCHELOR P.Ultra High Capacity Optical Transmission Networks:Final Report of Action COST 239[EB/OL].http://web.cnlab.ch/cost239/,1999.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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