29 August 2002 Tabu search algorithm to solve a logical topology design problem in WDM networks considering implementation cost
Author Affiliations +
Proceedings Volume 4909, Network Design and Management; (2002) https://doi.org/10.1117/12.481070
Event: Asia-Pacific Optical and Wireless Communications 2002, 2002, Shanghai, China
Abstract
We propose a Tabu Search (TS) algorithm to solve the problem of designing a logical topology for packet-switched traffic over a WDM mesh network. The cost of mapping such a logical topology over a physical network is taken into account. The algorithm provides approximate solutions of good quality (i.e., close to the optimal ones) to the corresponding optimization problem and allows us to solve problem instances of large size, which is usually impossible with algorithms solving exactly the Integer Linear Programming (ILP) formulations of the problem. The algorithm makes it possible to evaluate the cost-performance tradeoff between designing a logical topology with small congestion and a large number of (possibly expensive) lightpaths and designing a less expensive topology with higher congestion.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Josue Kuri, Nicolas Puech, Maurice Gagnaire, "Tabu search algorithm to solve a logical topology design problem in WDM networks considering implementation cost", Proc. SPIE 4909, Network Design and Management, (29 August 2002); doi: 10.1117/12.481070; https://doi.org/10.1117/12.481070
PROCEEDINGS
10 PAGES


SHARE
Back to Top