|標題:||Ant colony optimization for dynamic routing and wavelength assignment in WDM networks with sparse wavelength conversion|
Lin, Bertrand M. T.
Department of Information Management and Finance
|關鍵字:||Routing and wavelength assignment;Communication cost;Delay bound;Approximate solution;Ant colony optimization|
|摘要:||Since optical WDM networks are becoming one of the alternatives for building up backbones, dynamic routing, and wavelength assignment with delay constraints (DRWA-DC) in WDM networks with sparse wavelength conversions is important for a communication model to route requests subject to delay bounds. Since the NP-hard minimum Steiner tree problem can be reduced to the DRWA-DC problem, it is very unlikely to derive optimal solutions in a reasonable time for the DRWA-DC problem. In this paper, we circumvent to apply a meta-heuristic based upon the ant colony optimization (ACO) approach to produce approximate solutions in a timely manner. In the literature, the ACO approach has been successfully applied to several well-known combinatorial optimization problems whose solutions might be in the form of paths on the associated graphs. The ACO algorithm proposed in this paper incorporates several new features so as to select wavelength links for which the communication cost and the transmission delay of routing the request can be minimized as much as possible subject to the specified delay bound. Computational experiments are designed and conducted to study the performance of the proposed algorithm. Comparing with the optimal solutions found by an ILP formulation, numerical results evince that the ACO algorithm is effective and robust in providing quality approximate solutions to the DRWA-DC problem. (C) 2010 Elsevier Ltd. All rights reserved.|
|期刊:||ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE|
|Appears in Collections:||Articles|
Files in This Item: