loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh International Conference on Computer Communications and Networks (ICCCN '98)
Comparison of Two Swap Heuristics with a Genetic Algorithm for the Design of an ATM Network
Lafayette, Lousiana
October 12-October 15
ISBN: 0-8186-9014-3
ASCII Text
x 
 
Dale R. Thompson, Griff L. Bilbro, "Comparison of Two Swap Heuristics with a Genetic Algorithm for the Design of an ATM Network," Computer Communications and Networks, International Conference on, pp. 833, Seventh International Conference on Computer Communications and Networks (ICCCN '98), 1998.
 
 
BibTex
x
 
@article{ 10.1109/ICCCN.1998.998850,
author = {Dale R. Thompson and Griff L. Bilbro},
title = {Comparison of Two Swap Heuristics with a Genetic Algorithm for the Design of an ATM Network},
journal ={Computer Communications and Networks, International Conference on},
volume = {0},
year = {1998},
issn = {1095-2055},
pages = {833},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICCCN.1998.998850},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Communications and Networks, International Conference on
TI - Comparison of Two Swap Heuristics with a Genetic Algorithm for the Design of an ATM Network
SN - 1095-2055
SP
EP
A1 - Dale R. Thompson,
A1 - Griff L. Bilbro,
PY - 1998
KW - genetic algorithm
KW - ATM
KW - heuristic
KW - topology
VL - 0
JA - Computer Communications and Networks, International Conference on
ER -
 
Dale R. Thompson, USAE Waterways Experiment Station
Griff L. Bilbro, North Carolina State University
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.
Index Terms:
genetic algorithm, ATM, heuristic, topology
Citation:
Dale R. Thompson, Griff L. Bilbro, "Comparison of Two Swap Heuristics with a Genetic Algorithm for the Design of an ATM Network," icccn, pp.833, Seventh International Conference on Computer Communications and Networks (ICCCN '98), 1998
Usage of this product signifies your acceptance of the Terms of Use.