Comparison of two swap heuristics with a genetic algorithm for the design of an ATM network

Author

Thompson, Dale R. ; Gilbro, G.L.

Author_Institution

USAE Waterways Exp. Station, CEWES-IM-C, Vicksburg, MS, USA

fYear

1998

fDate

12-15 Oct 1998

Firstpage

833

Lastpage

837

Abstract

The challenge of a network topology design is to provide a configuration with minimum cost given specified constraints. Network topology design is NP-hard and known. Algorithms to solve these problems run in time that increases exponentially with the number of choices. The economic importance of determining the placement of switches in an ATM network justifies heuristic methods to find a good configuration within a reasonable amount of time. In this paper, two types of heuristic algorithms are compared. The first algorithm is based on swapping used switch locations with unused switch locations. The second algorithm is a genetic algorithm

Keywords

asynchronous transfer mode; computational complexity; genetic algorithms; network topology; telecommunication networks; ATM network; ATM network design; ATM switches; NP-hard problem; algorithms; economics; genetic algorithm; heuristic algorithms; network configuration; network topology design; swap heuristics; unused switch locations; used switch locations; Algorithm design and analysis; Asynchronous transfer mode; Costs; Delay; Genetic algorithms; Heuristic algorithms; Network topology; Routing; Switches; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Communications and Networks, 1998. Proceedings. 7th International Conference on

Conference_Location

Lafayette, LA

ISSN

1095-2055

Print_ISBN

0-8186-9014-3

Type

conf

DOI

10.1109/ICCCN.1998.998850

Filename

998850