期刊文献+

基于D*思想的动态RWA算法研究 被引量:2

Research on D * principle-based dynamic routing and wavelength assignment algorithm
在线阅读 下载PDF
导出
摘要 文章提出一种基于D*(D-Star)思想的启发式算法,求解波分复用(WDM)光网络中动态路由和波长分配(RWA)问题。将网络中各边代价与当前波长使用情况综合考虑,建立D*算法的估价函数,实现了WDM光网络中动态业务的高效分配。仿真结果表明,该算法能有效降低阻塞率,促进波长资源的合理分配,同时,其快速和智能特性也提高了网络故障环境下的生存性。 A heuristic algorithm based on D * principle is proposed for the dynamic Routing and Wavelength Assignment (RWA) in WDM networks. On the basis of comprehensive considerations of the cost of each edge and the current use of wavelengths in the network, the evaluation function of D* algorithm is constructed, achieving efficient assignment of the dynamic traffics in WDM networks. The simulation results show that this algorithm can effectively reduce the blocking rates, promote the rational assignment of the wavelength resource and at the same time its rapid and intelligent performances enhance the network survivability in a faulty environment.
出处 《光通信研究》 北大核心 2007年第2期4-7,共4页 Study on Optical Communications
基金 江苏省自然科学基金资助项目(04KJB520027)
关键词 波分复用光网络 路由和波长分配 D*算法 仿真 阻塞率 WDM networks RWA D* algorithm simulation blocking rate
  • 相关文献

参考文献6

  • 1Chen Chien,Banerjee Subrata.A new model for optimal routing and wavelength assignment in wavelength division multiplexed optical networks[A].INFOCOM'96[C].San Francisco:Fifteenth Annual Joint Conference of the IEEE Computer Societies.Networking the Next Generation.Proceedings IEEE,1996.164-171.
  • 2Zhu Na,Sun Haijin,Zhou Naifu.Ant colony optimization for dynamic RWA in WDM networks with partial wavelength[J].Photonic Network Communications,2006,11(2):229-236.
  • 3孙海金,朱娜,周乃富.基于蚁群系统的分布式RWA算法研究[J].光通信研究,2005(2):30-34. 被引量:4
  • 4Stentz A.Optimal and efficient path planning for partially-known environments[C].San Diego:In Proceedings of the IEEE International Conference on Robotics and Automation,1994.3 310-3 317.
  • 5Nilsson N J(著),郑扣根,庄越挺(译).人工智能[M].北京:机械工业出版社,1998.84-97.
  • 6Mokhtar A,Azizoglu M.Adaptive wavelength routing in all optical networks[J].IEEE/ ACM Transactions on Networking,1998,6 (2):197-206.

二级参考文献3

  • 1Chen C, BANERJEEs, A new model for optimal routing and wavelength assignment in wavelength division multiplexed optical networks [A]. Proc IEEE Infocom 96:164-171,.
  • 2Dorigo M. Heuristic from nature for hard combinatorial optimization problems [J ]. International Transactions in Operational Research, 1996,3(1) : 1-21.
  • 3Mokhtar A, Azizoglu M. Adaptive wavelength routing in all-optical networks [J]. IEEE/ACM. , Transactions on Networking, 1998,6(2): 197-206.

共引文献3

同被引文献19

  • 1段亚伟,朱娜,李正茂.基于遗传算法的动态RWA问题的研究[J].计算机工程与应用,2005,41(23):132-134. 被引量:1
  • 2陈旭,宋爱国.蚂蚁算法与免疫算法结合求解TSP问题[J].传感技术学报,2006,19(2):504-507. 被引量:7
  • 3李士波,孙秀霞,李海军.多约束条件下的飞行器航迹规划算法[J].电光与控制,2007,14(2):34-37. 被引量:22
  • 4LATOMBE J C. Robot motion planning [M]. Boston :Kluwer Academic Publishers ,1991.
  • 5STENTZ A. Optimal and efficient path planning for par- tially-known environments [ C ]//Proceedings of the IEEE International Conference on Robotics and Automa- tion, 1994:3310-3317.
  • 6蔡白兴,徐光佑.人工智能及其应用[M].3版.北京:清华大学出版社,2004:29-31.
  • 7LUGER G F.人工智能:复杂问题求解的结构和策略[M].4版.北京:机械工业出版社,2003.
  • 8FERGUSON D. Single agent and multi-agent path planning in unknown and dynamic environments [ D ]. Pittsburgh, Pennsylvania:The Robotics Institute, Carnegie Mellon Uni- versity,2006.
  • 9LIU Yunhui, ARIMOTO S. Computation of the tangent graph of polygonal obstacles by movlng-line processing [J]. IEEE Transactions on Robotics and Automation, 1994,10 (6) : 823- 830.
  • 10种琤 陈阳舟 崔平远 等.基于扫描法在线构造拓扑图的路线规划算法.计算机仿真,2008,29(7):788-792.

引证文献2

二级引证文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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