Journal of Northeastern University ›› 2009, Vol. 30 ›› Issue (4): 518-521.DOI: -

• OriginalPaper • Previous Articles     Next Articles

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:
    -

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.

CLC Number: