东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2009, Vol. 30 ›› Issue (4): 518-521.DOI: -

• 论著 • 上一篇    下一篇

ASON中一种新的动态路由和波长分配算法

杜荔;孟艳楼;毕晓红;   

  1. 东北大学信息科学与工程学院;
  • 收稿日期:2013-06-22 修回日期:2013-06-22 出版日期:2009-04-15 发布日期:2013-06-22
  • 通讯作者: Du, L.
  • 作者简介:-
  • 基金资助:
    国家高技术研究发展计划项目(2003AA781011);;

A new dynamic routing/wavelength assignment algorithm in ASON

Du, Li (1); Meng, Yan-Lou (1); Bi, Xiao-Hong (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-22 Revised:2013-06-22 Online:2009-04-15 Published:2013-06-22
  • Contact: Du, L.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

662

摘要： 在ASON中的网络节点不具备波长变换能力且光纤中复用的波长数有限的情况下,针对为到达的业务请求动态选路和波长分配问题,提出了一种新的动态路由和波长分配算法(N-RWA).该算法中设计了一种同时考虑节点跳数和当前网络状态的合理适应度函数,并将遗传算法和最小影响波长分配算法相结合,实现对传统RWA算法的改进.仿真结果表明,与传统的RWA算法相比,N-RWA算法在保证全网业务负载均衡的同时,大大降低了网络阻塞的可能性.

关键词: 自动交换光网络, 路由和波长分配, 最小影响, 遗传算法, 进化代数

Abstract: Considering the conditions that the nodes are unable to convert the wavelength and that the number of multiplex wavelengths is limited in optical fibres, a new routing/wavelength assignment (N-RWA) algorithm is proposed to solve dynamically the routing and wavelength assignment problem for the arrival of service request. In the new algorithm a rational fitness function is designed taking account simultaneously of the number of hops in a lightpath and the current network conditions and the genetic algorithm is in combination with least influence wavelength assignment algorithm, thus improving the conventional RWA algorithm. Simulation results showed that N-RWA can significantly reduces the blocking probability in comparison with the conventional RWA algorithm with balanced load kept on in the whole network.

中图分类号: