Inferring new design rules by machine learning: A case study of topological optimization

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.

Volumn 28, Issue 5, 1998, Pages 575-585

  Pierre, Samuel ^a,b  

^a IEEE   (Canada)

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

Author keywords

Computer networks; Inductive learning; Intelligent system; Knowledge acquisition; Topological design

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER NETWORKS; ELECTRIC NETWORK TOPOLOGY; INTEGER PROGRAMMING; KNOWLEDGE ACQUISITION; KNOWLEDGE BASED SYSTEMS; LEARNING ALGORITHMS;

INDUCTIVE LEARNING;

LEARNING SYSTEMS;

EID: 0032162976     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/3468.709602     Document Type: Article

References (33)

1. R. R. Boorstyn and H. Frank, "Large-scale network topological optimization," IEEE Trans. Commun., vol. COM-25, no. 1, pp. 29-47, 1977.
2. B. G. Buchanan, "Some approaches to knowledge acquisition," in Machine Learning: A Guide to Current Research, T. M. Mitchell, J. G. Carbonell and R. S. Michalski, Eds. Norwell, MA: Kluwer, 1986, pp. 19-24.
3. J. G. Carbonell, R. S. Michalski, and T. M. Mitchell, "An overview of machine learning," in Machine Learning: An Artificial Intelligence Approach, R. S. Michalski, J. G. Carbonell, and T. M. Mitchell, Eds. New York: Tioga, 1983, pp. 3-23.
4. T. Dietterich and R. Michalski, "A comparative review of selected methods for learning from examples," in Machine Learning: An Artificial Intelligence Approach, R. S. Michalski, J. G. Carbonell and T. M. Mitchell, Eds. New York: Tioga, 1983, pp. 41-82.
5. 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.
6. B. Gavish, "Topological design of computer networks - The overall design problem," Eur. J. Oper. Res., vol. 58, no. 2, pp. 149-172, 1992.
7. B. Gavish and I. Neuman, "A system for routing and capacity assignment in computer communication networks," IEEE Trans. Commun., vol. 37, no. 4, pp. 360-366, 1989.
8. 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.
9. 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.
10. 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.
11. 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.
12. R. M. Karp, "Combinatorics, complexity, and randomness," Commun. ACM, vol. 29, no. 2, pp. 97-109, 1986.
13. 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.
14. S. Kirkpatrick, "Optimization by simulated annealing: Quantitative studies," J. Stat. Phys., vol. 34, pp. 975-986, 1984.
15. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, May 1983.
16. D. B. Lenat, "Theory formation by heuristic search; The nature of heuristics II: Background and examples," Artif. Intell., vol. 21, pp. 31-59, 1983.
17. 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.
18. R. S. Michalski, "A theory and methodology of inductive learning," in Machine Learning: An Artificial Intelligence Approach, R. S. Michalski, J. G. Carbonell, and T. M. Mitchell, Eds. New York: Tioga, 1983, pp. 83-134.
19. C. L. Monma and D. D. Sheng, "Backbone network design and performance analysis: A methodology for packet switching networks," IEEE J. Select. Areas Commun., vol. SAC-4, no. 6, pp. 946-965, 1986.
20. 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.
21. S. Pierre, "Application of artificial intelligence techniques to computer network topology design," in Engineering Applications of Artificial Intelligence. London, U.K.: Pergamon, 1993, vol. 6, no. 5, pp. 465-472.
22. _, "A new methodology for generating rules in topological design of computer networks," Int. J. Eng. Applicat. Artif. Intell., vol. 8, no. 3, pp. 333-344, 1995.
23. S. Pierre, M.-A. Hyppolite, J.-M. Bourjolly, and O. Dioume, "Topological design of computer communications networks using simulated annealing," Int. J. Eng. Applicat. Artif. Intell., vol. 8, no. 1, pp. 61-69, 1995.
24. C. Rose, "Low mean internodal distance network topologies and simulated annealing," IEEE Trans. Commun., vol. 40, pp. 1319-1326, Aug. 1992.
25. V. R. Saksena, "Topological analysis of packet networks," IEEE J. Select. Areas Commun., vol. 7, no. 8, pp. 1243-1252, 1989.
26. S. I. Samoylenko, "Application of heuristic problem-solving methods in computer communication networks," Mach. Intell., vol. 3, no. 4, pp. 197-210, 1985.
27. 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.
28. C. Suk-Gwon, "Fair integration of routing and flow control in communications networks," IEEE Trans. Commun., vol. 40, no. 4, pp. 821-834, 1992.
29. 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., McLean, VA, Sept. 1985, pp. 102-110.
30. C. Tsatsarakis and D. Sleeman, "Supporting preprocessing and postprocessing for machine learning algorithms: A workbench for ID3," Knowl. Aquis., vol. 5, pp. 367-384, Dec. 1993.
31. P. J. M. Van Laarhoven and E. H. L. Aarts, Simulated Annealing: Theory and Applications. Dordrecht, The Netherlands: D. Reidel, 1987.
32. R. T. Wong, "Probabilistic analysis of a network design problem heuristic," Networks, vol. 15, pp. 347-362, 1985.
33. 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.