Designing communication network topologies using steady-state genetic algorithms

Author

Sayoud, H. ; Takahashi, K. ; Vaillant, B.

Author_Institution

Fac. of Eng., Multimedia Univ., Cyberjaya, Malaysia

Volume

5

Issue

3

fYear

2001

fDate

3/1/2001 12:00:00 AM

Firstpage

113

Lastpage

115

Abstract

This article presents the application of steady state genetic algorithms (SSGA) to minimize the total installation cost of a communication network by optimally designing the topology layout and assigning the corresponding capacities (TDCA problem). This highly constrained optimization problem is shown to be better solved using GAs. A binary representation of links between node pairs is developed and tested on a network of 20 nodes. Improved results, both in terms of network cost, performance and computation speed, are obtained when comparing with existing heuristic approaches.

Keywords

broadband networks; genetic algorithms; network topology; telecommunication network routing; TDCA problem; binary representation; broadband communication network; capacity assignment; communication network design; communication network topologies; computation speed; constrained optimization problem; heuristic approaches; network cost; network nodes; network routing; performance; steady-state genetic algorithms; topology layout; total installation cost minimization; Algorithm design and analysis; Communication networks; Computational efficiency; Computer networks; Constraint optimization; Cost function; Genetic algorithms; Network topology; Steady-state; Testing;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/4234.913157

Filename

913157