z-logo
Premium
A tutorial on using genetic algorithms for the design of network topology
Author(s) -
AlBassam Bassam,
Alheraish Abdulmohsen,
Bakry Saad Haj
Publication year - 2006
Publication title -
international journal of network management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.373
H-Index - 28
eISSN - 1099-1190
pISSN - 1055-7148
DOI - 10.1002/nem.597
Subject(s) - computer science , network topology , topology (electrical circuits) , logical topology , network planning and design , reliability (semiconductor) , internet topology , genetic algorithm , node (physics) , the internet , distributed computing , measure (data warehouse) , computer network , algorithm , data mining , mathematics , power (physics) , physics , structural engineering , combinatorics , quantum mechanics , machine learning , world wide web , engineering
The design of network topology is an important part of network design, since network topology is directly associated with network operational behavior, capacity, reliability, and cost. This paper is a tutorial paper concerned with illustrating how the optimization capabilities of genetic algorithms can be used to design suitable network topologies considering basic topology problems. Simple genetic algorithms have been developed for the topology problem of mesh networks, considering single node and single link failure tolerance. The algorithms are based on criteria of two important measures: minimizing the length of communication links; and minimizing traffic flow through these links for given traffic loads. The first measure contributes to minimizing the cost of cabling, while the second measure contributes to minimizing the cost of link capacity. The work provides a useful approach and tools to network students and professionals concerned with the topology design of backbone networks. The developed software is made available on the Internet. Copyright © 2006 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here