TY - JOUR
T1 - An Efficient Link Enhancement Strategy for Computer Networks using Genetic Algorithm
AU - Saha, Debashis
AU - Chakraborty, Uday Kumar
N1 - Topological expansion of a computer network for enhancing its geographical coverage, survivability and routability frequently involves an optimization...
PY - 1997/9/1
Y1 - 1997/9/1
N2 - Topological expansion of a computer network for enhancing its geographical coverage, survivability and routability frequently involves an optimization problem to select the best possible combination of links within a given budget limit. Since the problem is known to be NP-complete, heuristics are usually employed to minimize the search of links that may be added. With an objective to develop an efficient selection strategy that will produce either an optimal or a near-optimal solution quickly, a genetic algorithmic approach has been considered in the present work. The algorithm performs better than the previously published enhancement strategies. Simulation results are presented to substantiate this claim.
AB - Topological expansion of a computer network for enhancing its geographical coverage, survivability and routability frequently involves an optimization problem to select the best possible combination of links within a given budget limit. Since the problem is known to be NP-complete, heuristics are usually employed to minimize the search of links that may be added. With an objective to develop an efficient selection strategy that will produce either an optimal or a near-optimal solution quickly, a genetic algorithmic approach has been considered in the present work. The algorithm performs better than the previously published enhancement strategies. Simulation results are presented to substantiate this claim.
UR - https://www.sciencedirect.com/science/article/pii/S0140366497000698
U2 - 10.1016/S0140-3664(97)00069-8
DO - 10.1016/S0140-3664(97)00069-8
M3 - Article
VL - 20
JO - Computer Communications
JF - Computer Communications
ER -