AN EFFICIENT LINK ENHANCEMENT STRATEGY FOR COMPUTER-NETWORKS USING GENETIC ALGORITHM

Citation
D. Saha et Uk. Chakraborty, AN EFFICIENT LINK ENHANCEMENT STRATEGY FOR COMPUTER-NETWORKS USING GENETIC ALGORITHM, Computer communications, 20(9), 1997, pp. 798-803
Citations number
15
Categorie Soggetti
Computer Sciences","Computer Science Hardware & Architecture","Computer Science Software Graphycs Programming
Journal title
ISSN journal
01403664
Volume
20
Issue
9
Year of publication
1997
Pages
798 - 803
Database
ISI
SICI code
0140-3664(1997)20:9<798:AELESF>2.0.ZU;2-E
Abstract
Topological expansion of a computer network for enhancing its geograph ical coverage. survivability and routability frequently involves an op timization problem to select the best possible combination of links wi thin a given bud et limit. Since the problem is known to be NP-complet e. heuristics are usually employed to minimize the search of links tha t may be added. With an objective to develop an efficient selection st rategy that will produce either an optimal or a near-optimal solution quickly, a genetic algorithmic approach has been considered in the pre sent work. The algorithm performs better than the previously published enhancement strategics. Simulation results are presented to substanti ate this claim. (C) 1997 Elsevier Science B.V.