A genetic algorithm for designing distributed computer network topologies

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 28, Issue 2, 1998, Pages 249-258

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

^a Tel e University of Quebec   (Canada)

^b UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

Computer networks; Distributed systems; Genetic algorithms; Heuristic method; Topological design

Indexed keywords

EID: 0000935938     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/3477.662766     Document Type: Article

References (48)

1. R. Axelrod, "The evolution of strategies in the iterated prisoner's dilemma," in Genetic Algorithms and Simulated Annealing, L. Davis, Ed. Los Altos, CA: Morgan Kaufmann, 1987.
2. R. R. Boorstyn and H. Frank, "Large-scale network topological optimization," IEEE Trans. Commun., vol. COM-25, no. 1, pp. 29-47, 1977.
3. B. A. Coan, W. E. Leland, M. P. Vecchi, A. Wwinrib, and L. T. Wu, "Using distributed topology update and preplanned configurations to achieve trunk network survivability," IEEE Trans. Rel., vol. 40, no. 4, pp. 404-416, 1991.
4. L. A. Cox, L. Davis, and Y. Qiu, "Dynamic anticipatory routing in circuit-switched telecommunications networks," in Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold, 1991.
5. L. Davis, Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold, 1991.
6. _, Genetic Algorithms and Simulated Annealing. Los Altos, CA: Morgan Kaufmann, 1987.
7. L. Davis and S. Coombs, "Genetic algorithms and communication link speed design: Constraints and operators," in Proc. 2nd Int. Conf. Genetic Algorithms. Hillsdale, NJ: Lawrence Erlbaum, 1987.
8. _, "Optimizing network link sizes with genetic algorithms," in Modeling and Simulation Methodology, Knowledge System's Paradigms. Amsterdam, The Netherlands: Elsevier, 1989.
9. A. Dutta and S. Mitra, "Integrating heuristic knowledge and optimization models for communication network design," IEEE Trans. Knowl. Data Eng., vol. 5, no. 6, pp. 999-1017, 1993.
10. L. Fratta, M. Gerla, and L. Kleinrock, "The flow deviation method - An approach to store and forward communication network design," Networks, vol. 3, pp. 97-133, 1973.
11. B. Gavish, and I. Neuman, "Routing in a network with unreliable components," IEEE Trans. Commun., vol. 40, no. 7, pp. 1248-1258, 1992.
12. B. Gavish, "Topological design of computer communication network - The overall design problems," Eur. J. Oper. Res., vol. 58, pp. 149-172, 1992.
13. M. Gerla, H. Frank, W. Chou, and J. Eckl, "A cut saturation algorithm for topological design of packet-switched communication networks," in Proc. Nat. Telecomm. Conf., San Diego, CA, Dec. 1974, pp. 1074-1085.
14. M. Gerla and L. Kleinrock, "On the topological design of distributed computer networks," IEEE Trans. Commun., vol. COM-25, no. 1, pp. 48-60, 1977.
15. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley, 1989.
16. M. Grötschell and C. L. Monma, "Integer polyhedra arising from certain network design problems with connectivity constraints," SIAM J. Discrete Math., vol. 3, no. 4, pp. 502-523, 1990.
17. J. H. Holland, Adaptation in Natural and Artificial Systems. Ann Arbor, MI: Univ. of Michigan Press, 1975.
18. R.-H. Jan, F-J. Hwang, and S-T. Cheng, "Topological optimization of a communication network subject to a reliability constraint," IEEE Trans. Rel., vol. 42, no. 1, pp. 63-70, 1993.
19. K. Kamimura and H. Nishino, "An efficient method for determining economical configuration of elementary packet-switched networks," IEEE Trans. Commun., vol. 39, no. 2, pp. 278-288, 1991.
20. R. M. Karp, "Combinatorics, complexity, and randomness," Commun. ACM, vol. 29, no. 2, pp. 97-109, 1986.
21. A. Kershenbaum, P. Kermani, and G. A. Grover, "MENTOR: An algorithm for mesh network topological optimization and routing," IEEE Trans. Commun., vol. 39, no. 4, pp. 503-513, 1991.
22. A. Kershenbaum, Telecommunications Network Design Algorithms. New York: McGraw-Hill, 1993.
23. S. Kirkpatrick, "Optimization by simulated annealing: Quantitative studies," J. Stat. Phys., vol. 34, pp. 975-986, 1984.
24. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, May 1983.
25. L. Kleinrock, Queueing System, v.1 Theory, v.2 Computer Applications. New York: Wiley, 1976.
26. C. Mao-Cheng, "A remark on the number of vertices of degree k in a minimally k-edge-connected graph," Discrete Math., vol. 104, no. 3, pp. 221-226, 1992.
27. I. Neuman, "A system for priority routing and capacity assignment in packet switched networks," Ann. Oper. Res., vol. 36, pp. 225-246, 1992.
28. K. T. Newport and P. K. Varshney, "Design of survivable communications networks under performance constraints," IEEE Trans. Rel., vol. 40, no. 4, pp. 433-440, 1991.
29. S. Pierre, M.-A. Hyppolite, J.-M. Bourjolly, and O. Dioume, "Topological design of computer communications networks using simulated annealing," Eng. Applicat. Artif. Intell., vol. 8, no. 1, pp. 61-69, 1995.
30. S. Pierre, "A learning-by-example method for improving performance of network topologies," Eng. Applicat. Artif. Intell., vol. 7, no. 3, pp. 279-288, 1994.
31. _, "Application of artificial intelligence techniques to computer network topology design," Eng. Applicat. Artif. Intell., vol. 6, no. 5, pp. 465-472, 1993.
32. S. Pierre and H. H. Hoang, "SIDRO: un système intelligent pour le dimensionnement de réseaux d'ordinateurs," Actes des Onzièmes Journées Internationales sur les systèmes experts & leurs applications, Avignon, France (mai), vol. 5, pp. 51-62, 1991.
33. S. Pierre, H. H. Hoang, and E. Hausen-Tropper, "A knowledge-based system with learning for computer communication network design," Int. J. Telematics Informatics, vol. 7, nos. 3/4, pp. 455-466, 1990.
34. S. Pierre and H. H. Hoang, "An artificial intelligence approach for improving computer communications network topologies," J. Oper. Res. Soc., vol. 41, no. 5, pp. 405-418, 1990.
35. C. Rose, "Low mean internodal distance network topologies and simulated annealing," IEEE Trans. Commun., vol. 40, no. 8, pp. 1319-1326, 1992.
36. _, "Mean internodal distance in regular and random multihop networks," IEEE Trans. Commun., vol. 40, no. 8, pp. 1310-1318, 1992.
37. V. R. Saksena, "Topological analysis of packet networks," IEEE J. Select. Areas Commun., vol. 7, no. 8, pp. 1243-1252, 1989.
38. S. I. Samoylenko, "Application of heuristic problem-solving methods in computer communication networks," Mach. Intell., vol. 3, no. 4, pp. 197-210, 1985.
39. U. Schumacher, "An algorithm for construction of a K-connected graph with minimum number of edges and quasiminimal diameter," Networks, vol. 14, pp. 63-74, 1984.
40. M. Schwartz and T. E. Stern, "Routing techniques used in computer communication networks," IEEE Trans. Commun., vol. COM-28, no. 4, pp. 539-552, 1980.
41. S. S. Shapiro and M. B. Wilk, "Analysis of variance test for normality (complete samples)," Bimetrika, vol. 52, pp. 591-611, 1965.
42. S. F. Smith, "A learning system based on genetic adaptive algorithms," Ph.D. dissertation, Univ. Pittsburgh, Pittsburgh, PA, 1980.
43. C. Suk-Gwon, "Fair integration of routing and flow control in communication networks," IEEE Trans. Commun., vol. 40, no. 4, pp. 821-834, 1992.
44. E. A. Sykes and C. C. White, "Specifications of a knowledge system for packet-switched data network topological design," in Proc. Expert Systems Government Symp., Mc Lean, VA, Sept. 1985, pp. 102-110.
45. G. Syswerda, "Uniform crossover in genetic algorithms," in Proc. 3rd Conf. Genetic Algorithms. Los Altos, CA: Morgan Kaufmann, 1989.
46. M. J. Tomy and D. B. Hoang, "Joint optimization of capacity and flow assignment in a packet-switched communications network," IEEE Trans. Commun., vol. COM-35, no. 2, pp. 202-209, 1987.
47. P. J. M. Van Laarhoven, and E. H. L. Aarts, Simulated Annealing: Theory and Applications. Dordrecht, Holland: D. Reidel, 1987.
48. T. Yokohira, M. Sugano, T. Nishida, and H. Miyahara, "Fault tolerant packet-switched network design and its sensitivity," IEEE Trans. Rel., vol. 40, no. 4, pp. 452-460, 1991.