Topological design of local-area networks using genetic algorithms

Author

Elbaum, Reuven ; Sidi, Moshe

Author_Institution

Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel

Volume

4

Issue

5

fYear

1996

fDate

10/1/1996 12:00:00 AM

Firstpage

766

Lastpage

778

Abstract

In this paper, we describe an algorithm for designing local-area networks (LANs) with the objective of minimizing the average network delay. The topology design includes issues such as determination of the number of segments in the network, allocating the users to the different segments, and determining the interconnections and routing among the segments. The determination of the optimal LAN topology is a very complicated combinatorial optimization problem. Therefore, a heuristic algorithm that is based on genetic ideas is used. Numerical examples are provided and the quality of the designs obtained by using the algorithm is compared with lower bounds on the average network delay that are developed

Keywords

combinatorial mathematics; delays; genetic algorithms; local area networks; minimisation; network topology; performance evaluation; telecommunication network routing; LAN; average network delay; combinatorial optimization problem; genetic algorithms; heuristic algorithm; interconnections; local-area networks; optimal LAN topology; routing; segment numbers; topological design; Algorithm design and analysis; Bridges; Genetic algorithms; LAN interconnection; Local area networks; Media Access Protocol; Network topology; Open systems; Routing; Simulated annealing;

fLanguage

English

Journal_Title

Networking, IEEE/ACM Transactions on

Publisher

ieee

ISSN

1063-6692

Type

jour

DOI

10.1109/90.541324

Filename

541324