Share Email Print

Proceedings Paper

Tabu search algorithm to solve a logical topology design problem in WDM networks considering implementation cost
Author(s): Josue Kuri; Nicolas Puech; Maurice Gagnaire
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 29 August 2002
PDF: 10 pages
Proc. SPIE 4909, Network Design and Management, (29 August 2002); doi: 10.1117/12.481070
Show Author Affiliations
Josue Kuri, Ecole Nationale Superieure des Telecommunications Paris (France)
Nicolas Puech, Ecole Nationale Superieure des Telecommunications Paris (France)
Maurice Gagnaire, Ecole Nationale Superieure des Telecommunications Paris (France)

Published in SPIE Proceedings Vol. 4909:
Network Design and Management
Qian Mao; Shoa-Kai Liu; Kwok-wai Cheung, Editor(s)

© SPIE. Terms of Use
Back to Top