Generating near-optimal survivable topologies

Author

Morais, Rui Manuel ; Monteiro, Paulo ; Pinto, Armando Nolasco

Author_Institution

Dept. of Electron., Telecommun. & Inf, Univ. of Aveiro, Aveiro, Portugal

fYear

2012

fDate

2-5 July 2012

Firstpage

1

Lastpage

4

Abstract

Given the node location and the traffic matrix, the survivable topological design is the problem of determining the network topology at minimum capital expenditure such that survivability is ensured. This problem is strongly NP-hard and heuristics are traditionally used to search near-optimal solutions. We present a genetic algorithm for this problem and analyze the impact of the initial population in the obtained results.

Keywords

computational complexity; genetic algorithms; telecommunication network topology; telecommunication traffic; wavelength division multiplexing; genetic algorithm; minimum capital expenditure; near-optimal solutions; near-optimal survivable topologies; network topology; node location; strongly NP-hard problem; survivability; survivable topological design; traffic matrix; Generators; Genetic algorithms; Network topology; Optical fiber networks; Topology; Wavelength division multiplexing; heuristic algorithms; survivability; topological design;

fLanguage

English

Publisher

ieee

Conference_Titel

Transparent Optical Networks (ICTON), 2012 14th International Conference on

Conference_Location

Coventry

ISSN

2161-2056

Print_ISBN

978-1-4673-2228-7

Electronic_ISBN

2161-2056

Type

conf

DOI

10.1109/ICTON.2012.6253877

Filename

6253877