科研之友
微信
新浪微博
Facebook
分享链接
摘要
Anycast routing and wavelength assignment without using wavelength conversion has been intensively studied in wavelength-division multiplexing (WDM) networks. In a realistic WDM network, semilightpath (a transmission path constructed by chaining together several lightpaths using wavelength conversion) is needed since wavelength-continuous path may not be available for a set of anycast requests. However, wavelength conversion is still expensive and results in degradation of signal quality. Therefore, efficient usage of wavelength conversion is of practical interest. In this paper, we first study the wavelength conversion-based anycast routing and wavelength assignment (WCARW) problem. When the network and the set of anycast requests are given, the WCARW is to find a set of paths and assign wavelengths to them. The goal of the WCARW is to minimize total number of wavelength conversions used over all paths subject to the end-to-end conversion bound constraints. For this NP-complete problem, we present a tabu-search anycast routing and wavelength assignment algorithm (TARWA), and compare it with the shortest anycast path routing and first-fit wavelength assignment algorithm (SAFF). Simulation results indicate that TARWA performs significantly better in terms of the number of wavelength conversions as well as blocking probability.
