An ant algorithm for single-hop wavelength assignment in WDM mesh network

A RWA linear programming formulation was formulated and ILP solver was used along with good approximation techniques (heuristic) to solve the static RWA problem The objective was to maximize the one hop traffic, given a set of lightpath requests/traffic demand. However, the proposed heuristic has the limitation of stagnation. Thus we applied ant colony optimization (ACO) combined with heuristic algorithm to solve the assignment problem to obtain best assignment with highest objective value. The ACO based algorithm can outperform the comparison scheme and provide a better performance and more reliable than the proposed heuristic and ILP solver. The claim made in the paper for the proposed new heuristic and ACO are supported by experimental results

[1]  Zhensheng Zhang,et al.  A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength reuse , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[2]  M. C. Sinclair,et al.  Ant colony optimisation for virtual-wavelength-path routing and wavelength allocation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[3]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[4]  Jitender S. Deogun,et al.  A Genetic Algorithm for Routing in WDM Optical Networks with Power Considerations Part I: The Unicast Case , 1999 .

[5]  Biswanath Mukherjee,et al.  Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study , 2000, TNET.

[6]  Biswanath Mukherjee,et al.  Some principles for designing a wide-area WDM optical network , 1996, TNET.

[7]  Biswanath Mukherjee,et al.  WDM optical communication networks: progress and challenges , 2000, IEEE Journal on Selected Areas in Communications.

[8]  Marco Mellia,et al.  Logical topologies design over WDM wavelength routed networks robust to traffic uncertainties , 2001, IEEE Communications Letters.

[9]  Massimo Tornatore,et al.  WDM network optimization by ILP based on source formulation , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[10]  Kyungsik Lee,et al.  An Optimization Approach to Routing and Wavelength Assignment in WDM All‐Optical Mesh Networks without Wavelength Conversion , 2002 .

[11]  Kumar N. Sivarajan,et al.  Optical Networks: A Practical Perspective , 1998 .

[12]  Marco Dorigo,et al.  Mobile agents for adaptive routing , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.

[13]  Xiaohong Jiang,et al.  Dynamic RWA based on the combination of mobile agents technique and genetic algorithm in WDM networks with sparse wavelength conversion , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[14]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[15]  Branko Mikac,et al.  A heuristic approach to wavelength assignment in all-optical networks , 1998, MELECON '98. 9th Mediterranean Electrotechnical Conference. Proceedings (Cat. No.98CH36056).

[16]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

[17]  Wayne D. Grover,et al.  Tabu search optimization of optical ring transport networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[18]  Filip De Turck,et al.  Dimensioning of survivable WDM networks , 1998, IEEE J. Sel. Areas Commun..

[19]  S. Banerjee,et al.  Design of wavelength-routed optical networks for packet switched traffic , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[20]  E.-G. Talbia,et al.  Parallel Ant Colonies for the quadratic assignment problem , 2001, Future Gener. Comput. Syst..

[21]  Ying Wang,et al.  Ant colony optimization for multicast routing , 2000, IEEE APCCAS 2000. 2000 IEEE Asia-Pacific Conference on Circuits and Systems. Electronic Communication Systems. (Cat. No.00EX394).

[22]  Griff L. Bilbro,et al.  Comparison of a genetic algorithm with a simulated annealing algorithm for the design of an ATM network , 2000, IEEE Communications Letters.

[23]  Byrav Ramamurthy,et al.  Routing algorithms for all-optical networks with power considerations: the unicast case , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[24]  Xiaohong Jiang,et al.  Adaptive routing and wavelength assignment using ant-based algorithm , 2004, Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955).

[25]  P. Sreenivasa Kumar,et al.  Static lightpath establishment in WDM networks - New ILP formulations and heuristic algorithms , 2002, Comput. Commun..