Evolutionary computation for topological optimization of 3-connected computer networks

Author

Ombuki, B. ; Nakamura, M. ; Nakao, Z. ; Onaga, K.

Author_Institution

Fac. of Eng., Ryukyus Univ., Okinawa, Japan

Volume

1

fYear

1999

fDate

1999

Firstpage

659

Abstract

In the 3-connected computer network design problem, a set of links is to be assigned to some computer sites (nodes) such that every source-destination pair of nodes can successfully communicate with each other via at least one of three diverse paths. The objective is to minimize the total link connection costs while maintaining the 3-connectivity constraint. We develop two heuristics, a greedy heuristic and a genetic algorithm (GA) based heuristic to approximately solve the design problem. An experimental evaluation shows that the GA consistently outperforms the greedy algorithm for the problem instances considered

Keywords

computer networks; genetic algorithms; heuristic programming; minimisation; computer network design problem; evolutionary computation; experimental evaluation; genetic algorithm; greedy heuristic; minimization; source-destination nodes; three-connected computer networks; topological optimization; total link connection costs; Algorithm design and analysis; Communication networks; Computer network reliability; Computer networks; Costs; Evolutionary computation; Genetic algorithms; Greedy algorithms; Spine; Telecommunication network reliability;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, Man, and Cybernetics, 1999. IEEE SMC '99 Conference Proceedings. 1999 IEEE International Conference on

Conference_Location

Tokyo

ISSN

1062-922X

Print_ISBN

0-7803-5731-0

Type

conf

DOI

10.1109/ICSMC.1999.814170

Filename

814170