Routing Algorithm with Adaptive Weight Function based on Possible Available Wavelength in Optical WDM Networks

  • Pavarangkoon, Praphan (Department of Electronics Faculty of Engineering and Research Center for Communications and Information Technology (ReCCIT) King Mongkut's Institute of Technology Ladkrabang) ;
  • Thipchaksurat, Sakchai (Department of Computer Engineering Faculty of Engineering and Research Center for Communications and Information Technology (ReCCIT) King Mongkut's Institute of Technology Ladkrabang) ;
  • Varakulsiripunth, Ruttikorn (Department of Electronics Faculty of Engineering and Research Center for Communications and Information Technology (ReCCIT) King Mongkut's Institute of Technology Ladkrabang)
  • Published : 2004.08.25

Abstract

In this paper, we have proposed a new approach of routing and wavelength assignment algorithms, called Possible Available Wavelength (PAW) algorithm. The weight of a link is used as the main factor for routing decision in PAW algorithm. The weight of a link is defined as a function of hop count and available wavelengths. This function includes a determination factor of the number of wavelengths that are being used currently and are supposed to be available after a certain time. The session requests from users will be routed on the links that has the greatest number of link weight by using Dijkstra's shortest path algorithm. This means that the selected lightpath will has the least hop count and the greatest number of possible available wavelengths. The impact of proposed link weight computing function on the blocking probability and link utilization is investigated by means of computer simulation and comparing with the traditional mechanism. The results show that the proposed PAW algorithm can achieve the better performance in terms of the blocking probability and link utilization.

Keywords