Designing B-ISDN network topologies using the genetic algorithm

Author

Qin, Zhigang ; Wu, Felix F. ; Law, N.

Author_Institution

Optimal Networks, Pala Alto, CA, USA

fYear

1997

fDate

12-15 Jan 1997

Firstpage

140

Lastpage

145

Abstract

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

Keywords

B-ISDN; asynchronous transfer mode; convergence of numerical methods; genetic algorithms; integer programming; network topology; nonlinear programming; planning; ATM; B-ISDN; biconnectivity requirement; convergence property; genetic algorithm; network topologies design; nonlinear mixed-integer programming problem; optimization method; topological planning; Algorithm design and analysis; Asynchronous transfer mode; B-ISDN; Genetic algorithms; Heuristic algorithms; Network topology; Packet switching; Perturbation methods; Switching circuits; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Haifa

Print_ISBN

0-8186-7758-9

Type

conf

DOI

10.1109/MASCOT.1997.567599

Filename

567599