By Topic

Topological design of local-area networks using genetic algorithms

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)
Elbaum, R. ; Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel ; Sidi, M.

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

Published in:

Networking, IEEE/ACM Transactions on  (Volume:4 ,  Issue: 5 )