An efficient link enhancement strategy for computer networks using genetic algorithm

Computer Communications

Volumn 20, Issue 9, 1997, Pages 798-803

  Saha, Debashis ^a   Chakraborty, Uday Kumar ^a  

^a JADAVPUR UNIVERSITY   (India)

Author keywords

Computer networks; Genetic algorithm; Heuristics; Link enhancement; Network management; Topological expansion

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; MANAGEMENT; PERFORMANCE; TELECOMMUNICATION LINKS; TOPOLOGY;

NETWORK MANAGEMENT;

COMPUTER NETWORKS;

EID: 0031559617     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0140-3664(97)00069-8     Document Type: Article

References (15)

1. T.H. Wu, R. Cardwell, M. Boyden, A multi-period architectural selection and optimum capacity allocation for future SONET inter office networks, ORSA/TIMS Joint National Meeting, PA, Oct, 1990.
2. L.J. Leblane, S. Narasimhan, Topological expansion of metropolitan area networks, CN & ISDN Systems 26 (1994) 1235-1248.
3. C. Yang, Link enhancement using constrained range and reduced candidate set searches, Computer Communications 15 (9) (1992) 573-580.
4. C. Yang, R. Lin, Budget management of network capacity planning by searching constrained range and dominant set, IEEE Journal Select Areas Commun. 12 (6) (1994) 301-308.
5. D. Saha, A. Mukherjee, S.K. Dutta, Capacity assignment in computer communication networks with unreliable links, Computer Communications 17 (12) (1994) 871-875.
6. D. Saha, A. Mukherjee, Design of hierarchical communication networks under node/link failure constraints, Computer Communications 18 (5) (1995) 378-383.
7. D. Saha, A. Mukherjee, Computational analysis of an optimal routing strategy in a hierarchical computer communication network, Computer Communications 18 (7) (1995) 507-511.
8. J.H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, 1975.
9. D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA, 1989.
10. U.K. Chakraborty, D.G. Dastidar, Using reliability analysis to estimate the number of generations to convergence in genetic algorithms, Information Processing Letters 46 (4) (1993) 199-209.
11. U.K. Chakraborty, A simpler derivation of schema hazard in genetic algorithms, Information Processing Letters 56 (2) (1995) 77-78.
12. U.K. Chakraborty, A branching process model for genetic algorithms, Information Processing Letters 56 (5) (1995) 281-292.
13. U.K. Chakraborty, K. Deb, M. Chakraborty, Analysis of selection algorithms: A Markov chain approach, Evolutionary Computation 4 (2) (1996) 133-167.
14. D. Saha, A. Mukherjee, Managing the topological expansion of computer networks in an optimal way, Int. Journal Network Management (1996), to appear.
15. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.