By Topic

Designing B-ISDN network topologies using the 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
$33 $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

3 Author(s)
Zhigang Qin ; Optimal Networks, Pala Alto, CA, USA ; F. F. Wu ; N. Law

The topology design of a B-ISDN network is addressed. We model the topological planning as a nonlinear mixed-integer programming problem. The genetic algorithm, an effective optimization method, is applied to this problem. Since the randomness of the generic algorithm cannot guarantee the biconnectivity requirement in the topologies generated by the genetic algorithm, we propose an algorithm to make all topologies at least biconnected while increasing the overall cost of the topologies the least. The result for a 20-node test case is presented and it is shown that the algorithm we propose has a very good convergence property

Published in:

Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1997. MASCOTS '97., Proceedings Fifth International Symposium on

Date of Conference:

12-15 Jan 1997