An evolutionary approach for configuring economical packet switched computer networks

Artificial Intelligence in Engineering

Volumn 10, Issue 2, 1996, Pages 127-134

  Pierre, Samuel ^a   Legault, Gisèle ^a  

^a Tel e University of Quebec   (Canada)

Author keywords

Computer networks; Genetic algorithms; Heuristic method; Topological design

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; ELECTRIC NETWORK TOPOLOGY; GENETIC ALGORITHMS; HEURISTIC METHODS; LINEAR PROGRAMMING; NONLINEAR PROGRAMMING; OPTIMIZATION; PACKET NETWORKS; PERTURBATION TECHNIQUES; PROBLEM SOLVING;

COMMUNICATION COSTS; COMPUTER NETWORK TOPOLOGY; QUALITY OF SERVICE;

COMPUTER NETWORKS;

EID: 0029734414     PISSN: 09541810     EISSN: None     Source Type: Journal    
DOI: 10.1016/0954-1810(95)00022-4     Document Type: Article

References (30)

1. Boorstyn, R. R. & Frank, H. Large-scale network topological optimization. IEEE Transactions on Communications, COM-25(1) (1977) 29-47.
2. Fratta, L., Gerla, M. & Kleinrock, L. The flow deviation method - An approach to store and forward communication network design. Networks, 3 (1973) 97-133.
3. Gavish, B. & Neuman, I. Routing in a network with unreliable components. IEEE Transactions on Communications, 40(7) (1992) 1248-58.
4. Gavish, B. Topological design of computer communication network - the overall design problems. European Journal of Operational Research, 58 (1992) 149-72.
5. Gerla, M. The design of store-and-forward (S/F) networks for computer communications. Engineering Report UCLA-ENG-7319, University of California, Los Angeles, School of Engineering and Applied Science, 1973.
6. Gerla, M., Frank, H., Chou, W. & Eckle, J. A cut saturation algorithm for topological design of packet switched communication networks. In Proceedings of National Telecommunication Conference, 1974.
7. Gerla, M. & Kleinrock, L. On the topological design of distributed computer networks. IEEE Transactions on Communications, COM-25 (1) (1977) 48-60.
8. Yokohira, T., Masashi, S., Takeshi, N. & Hideo, M. Fault tolerant packet-switched network design and its sensitivity. IEEE Transactions on Reliability, 40(4) (1991) 452-60.
9. Dutta, A. & Mitra, S. Integrating heuristic knowledge and optimization models for communication network design. IEEE Transactions on Knowledge and Data Engineering, 5(6) (1993) 999-1017.
10. Pierre, S. Application of artificial intelligence techniques to computer network topology design. Engineering Applications of Artificial Intelligence, 6(5) (1993) 465-72.
11. Kershenbaum, A. Telecommunications Network Design Algorithms. McGraw-Hill, New York, 1993.
12. Neuman, I. A system for priority routing and capacity assignment in packet switched networks. Annals of Operations Research, 36 (1992) 225-46.
13. Schwartz, M. & Stern, T. E. Routing techniques used in computer communication networks. IEEE Transactions on Communications, COM-28(4) (1980) 539-52.
14. Tomy, M. J. & Hoang, D. B. Joint optimization of capacity and flow assignment in a packet-switched communications networks. IEEE Transactions on Communications, COM35(2) (1987) 202-9.
15. Smith, S. F. A learning system based on genetic adaptive algorithms. PhD dissertation, University of Pittsburg, 1980.
16. Pierre, S. A learning-by-example method for improving performance of network topologies. Engineering Applications of Artificial Intelligence, 7(3) (1994) 279-88.
17. Pierre, S. Acquisition de connaissances pour la conception topologique de réseaux téléformaiques. In Thirteenth International Conference, Artificial Intelligence, Expert Systems, Natural Language, Avignon, France, Vol. 2, 1993, pp. 177-86.
18. Pierre, S. & Hoang, H. H. SIDRO: un système intelligent pour le dimensionnement de réseaux d'ordinateurs. Onzièmes Journées Internationales sur les Systèmes Experts & leurs Applications. Avignon, France, Vol. 5, 1991, pp. 51-62.
19. Pierre, S. & Hoang, H. H. An artificial intelligence approach to improving computer communications network topologies. J. Opt. Res. Soc., 41(5) (1990) 405-18.
20. Pierre, S., Hoang, H. H. & Hausen-Tropper, E. A knowledge-based system with learning for computer communication network design. Telematics and Informatics, 7(3-4) (1990) 455-66.
21. Cavicchio, D. J. Adaptive search using simulated evolution. PhD dissertation, University of Michigan, Ann Arbor, MI, 1970.
22. Grötschell, M. & Monma, C. L. Integer polyhedra arising from certain network design problems with connectivity constraints. SIAM J. Disc. Math., 3(4) (1990) 502-23.
23. Kleinrock, L. Queueing Systems, Vol. 1 Theory, Vol. 2 Computer Applications. John Wiley, New York, 1976.
24. Axelrod, R. The evolution of strategies in the iterated prisoner's dilemma. In Genetic Algorithms and Simulated Annealing, ed. L. Davis. Morgan Kaufmann, Los Altos, CA.
25. Davis, L. (ed). Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York, 1991.
26. Davis, L. & Coombs, S. Genetic algorithms and communication link speed design: constraints and operators. Proceedings of the Second International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale, NJ, 1987.
27. Davis, L. & Coombs, S. Optimizing network link sizes with genetic algorithms. In Modelling and Simulation Methodology, Knowledge System's Paradigms. Elsevier Science Publishers, Oxford, 1989.
28. Goldberg, D. E. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Don Mills, Reading, MA, 1989.
29. Holland, J. H. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, MI, 1975.
30. Syswerda, G. Uniform crossover in genetic algorithms. Proceedings of the Third Conference on Genetic Algorithms. Morgan Kaufmann, Los Altos, CA, 1989.