Parallel genetic algorithms for communication network design

Author

Huang, Runhe ; Ma, Jianhua ; Kunii, Tosiyasu L. ; Tsuboi, Eiju

Author_Institution

Aizu Univ., Japan

fYear

1997

fDate

17-21 Mar 1997

Firstpage

370

Lastpage

377

Abstract

This paper is devoted to developing a genetic algorithm for a communication network design that minimizes total link cost, and subjects to some constraints like diameter and two-connectivity. Two parallel genetic algorithms on the level of partitioning requirements and the level of dividing population are proposed and implemented over a transputer based parallel network with various virtual network topologies. The ring-ring topology gives the best performance for the parallel genetic algorithm on the level of partitioning requirements, and the torus topology is the most suitable topology for the parallel genetic algorithm on the level of dividing population

Keywords

genetic algorithms; network topology; parallel algorithms; telecommunication computing; telecommunication network routing; communication network design; diameter; dividing population; parallel genetic algorithms; partitioning requirements; ring-ring topology; torus topology; total link cost; transputer based parallel network; two-connectivity; virtual network topologies; Algorithm design and analysis; Cities and towns; Communication networks; Costs; Genetic algorithms; Network topology; Optical fiber communication; Partitioning algorithms; Random number generation; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Algorithms/Architecture Synthesis, 1997. Proceedings., Second Aizu International Symposium

Conference_Location

Aizu-Wakamatsu

Print_ISBN

0-8186-7870-4

Type

conf

DOI

10.1109/AISPAS.1997.581701

Filename

581701