By Topic

The Research of an Approach to Design Local Area Network Topology Based on Genetic Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fei Teng ; State Key Lab. of Software Develop Environ., Beijing Univ. of Aeronaut. & Astronaut., Beijing, China ; Gang Zhou

The topological design of local area network is a process to find the network with the best performance, minimum cost and highest reliability, under the objective and engineering constraints. The problem could be considered as a multi-objective optimization problem, owing to that it requires all kinds of network performances be optimized at the same time and keeps the cost minimum, and has been proven to be a NP-hard problem by some researchers. There is no existing effective determinant algorithm that can solve it so far. In this paper, we introduce the Pareto optimization theory, Pareto ranking technique and the Pareto converging genetic algorithm based on them, and a PCGA based algorithm for solving bicriteria network topology design problems of local area network, is presented, considering the network average delay and network cost. We also adopt the Pru¿fer number to represent chromosomes in order to ensure the tree topology of LAN. Besides, traditional crossover approach is improved to speed up the algorithm and a new variant based halting criteria is proposed to enhance the stability of the GA results. Thought the comparison between our results and that of exhausted search, our algorithm turns out to be correct and effective, and compared with the classic NPGA, the proposed method can search faster and produce topologies closer to the real Pareto-front.

Published in:

Computational Intelligence and Design, 2009. ISCID '09. Second International Symposium on  (Volume:1 )

Date of Conference:

12-14 Dec. 2009