Network migration using ant colony optimization

Author

Türk, Stefan ; Radeke, Rico ; Lehnert, Ralf

Author_Institution

Dresden Univ. of Technol., Dresden, Germany

fYear

2010

fDate

7-9 June 2010

Firstpage

1

Lastpage

6

Abstract

This paper describes the basic concepts of the network migration problem, as well as its cost optimal solution with an ant colony algorithm. Generally there are many possible approaches to calculate network migration strategies. One of those is to consider the migration as a Shortest Path Problem, which can be solved using meta heuristics. In this paper it will be analyzed how ant colony optimization can be used to calculate migration sequences with minimized costs. Results of our investigation are information about the speed of convergence of ant colony algorithms towards an optimal cost value. The used resource utilization to cover increasing network demands will be presented also.

Keywords

optical fibre networks; optimisation; telecommunication traffic; ant colony algorithm; meta heuristics; migration sequences; network migration problem; network migration strategies; optical backbone networks; shortest path problem; traffic demand; Ant colony optimization; Cities and towns; Copper; Hardware; IP networks; Optical switches; Resource management; Ant colony optimization; Communication system economics; Network migration; Optimization methods; Wide area networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Telecommunications Internet and Media Techno Economics (CTTE), 2010 9th Conference on

Conference_Location

Ghent

Print_ISBN

978-1-4244-7988-7

Electronic_ISBN

978-1-4244-7986-3

Type

conf

DOI

10.1109/CTTE.2010.5557713

Filename

5557713