Research: An efficient link enhancement strategy for computer networks using genetic algorithm

Authors:
Debashis Saha;Uday Kumar Chakraborty
Affiliations:
Department of Computer Science and Engineering, Jadavpur University, Calcutta 700 032, India;Department of Computer Science and Engineering, Jadavpur University, Calcutta 700 032, India
Venue:
Computer Communications
Year:
1997

Citing 13
Cited 2

Link enhancement using constrained range and reduced candidate set searches

Computer Communications
Using reliability analysis to estimate the number of generations to convergence in genetic algorithms

Information Processing Letters
Topological expansion of metropolitan area networks

Computer Networks and ISDN Systems
A simpler derivation of schema hazard in genetic algorithms

Information Processing Letters
A branching process model for genetic algorithms

Information Processing Letters
Managing the Topological Expansion of Computer Networks in an Optimal Way

International Journal of Network Management
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Analysis of selection algorithms: A markov chain approach

Evolutionary Computation
Research: Computational analysis of an optimal routing strategy in a hierarchical computer communication network

Computer Communications
Research note: Capacity assignment in computer communication networks with unreliable links

Computer Communications
Research note: Design of hierarchical communication networks under node/link failure constraints

Computer Communications
Budget management of network capacity planning by searching constrained range and dominant set

IEEE Journal on Selected Areas in Communications

Integrated genetic algorithm and goal programming for network topology design problem with multiple objectives and multiple criteria

IEEE/ACM Transactions on Networking (TON)
An approach to wide area WDM optical network design using genetic algorithm

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

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.