Skip to main content

An Artificial Intelligence Approach to Improving Computer Communications Network Topologies

  • Chapter
Artificial Intelligence in Operational Research
  • 65 Accesses

Abstract

This paper presents an artificial intelligence approach to solving the network design problem. The major issue under consideration is the various topological aspects of a design, especially in the case of large computer networks. The combinatorial explosion can only be dealt with, hopefully, by means of heuristics, which drastically reduce the search space of candidate topologies. The proposed approach is essentially a general framework for integrating conventional approximate methods and knowledge-based systems. An inference engine is then a means suited to extending the realm of local transformations used in conventional heuristics. Sophisticated goal-directed searches can be achieved by using knowledge bases, which are large sets of detailed design rules.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Hausen-Tropper (1986) An application of learning algorithms to telecommunication networks. Presented at the Sixth International Workshop on Expert Systems and Their Applications, Avignon, France, June 1986, pp. 869–881.

    Google Scholar 

  2. S. Pierre and E. Hausen-tropper (1986) Design topologique de réseaux téléinformatiques de grande taille: une nouvelle approche. Presented at IEEE Montech’86, Montréal, Canada, pp. 370–372.

    Google Scholar 

  3. H. H. Hoang (1982) Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition. IEEE Transactions on Automatic Control AC-27, 165–169.

    Google Scholar 

  4. M. Gerla and L. Kleinrock (1977) On the topological design of distributed computer networks. IEEE Trans. on Communications COM-25, 48–60.

    Article  MathSciNet  Google Scholar 

  5. H. Frank and W. Chou (1972) Topological optimization of computer networks. Proc. of the IEEE 60, 1385–1397.

    Article  Google Scholar 

  6. R. R. Boorstyn and H. Frank (1977) Large-scale network topological optimization. IEEE Trans. on Communication COM-25, 29–47.

    Article  Google Scholar 

  7. D. S. Johnson, J. K. Lenstra and A. H. G. Rinnooy Kan (1978) The complexity of the network design problem. Networks 8, 279–285.

    Article  MathSciNet  MATH  Google Scholar 

  8. R. M. Karp (1986) Combinatorics, complexity, and randomness. CACM 29, 97–109.

    Article  MathSciNet  Google Scholar 

  9. M. Gerla (1973) The design of store-and-forward networks for computer communications. PhD Dissertation, University of California, Los Angeles.

    Google Scholar 

  10. H. Frank and I. Frisch (1971) Communication, Transmission and Transportation Networks. Addison-Wesley, Reading, Massachusetts.

    MATH  Google Scholar 

  11. M. Gerla, H. Frank, W. Chou and J. Eckl (1974) A cut saturation algorithm for topological design of packetswitched communication networks. In Proceedings of the National Telecommunications Conference, pp. 1074–1085.

    Google Scholar 

  12. A. Lavia and E. G. Manning (1975) Perturbation techniques for topological optimization of computer networks. In Proceedings of Fourth Data Communications Symposium, Québec City, Canada, October 1975. pp. 16–23.

    Google Scholar 

  13. L. Kleinrock and F. Kamoun (1980) Optimal clustering structures for hierarchical topological design of large computer networks. Networks 10, 221–248.

    Article  MathSciNet  MATH  Google Scholar 

  14. K. J. Chen, J. F. Stach and T. H. Wu (1985) A new method for topological design in large, traffic laden packet switched networks. Proceedings of the Ninth Data Communications Symposium. ACM SIGCOMM Computer Communication Review 15, 115–121.

    Article  Google Scholar 

  15. E. A. Sykes and C. C. White (1985) Specifications of a knowledge system for packet-switched data network topological design. Presented at the Expert Systems in Government Symposium, McLean, Virginia, September 1985, pp. 102–110.

    Google Scholar 

  16. E. Hausen-Tropper, H. H. Hoang and S. Pierre (1989) Approache système expert pour Ia conception de réseaux téléinformatiques de grande taille. Neuviémes journées internationales sur les systèmes experts et leurs applications, Avignon, France. In Intelligence Artifecielle et Télécommunications pp. 134–148.

    Google Scholar 

  17. S. Pierre, H. H. Hoang and E. Hausen-Tropper (1989) An expert systems application in computer network topological design. Presented at the IASTED International Conference on Expert Systems, Zurich, Switzerland, June 1989, pp. 139–142.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Copyright information

© 1992 Operational Research Society Ltd

About this chapter

Cite this chapter

Pierre, S., Hoang, HH. (1992). An Artificial Intelligence Approach to Improving Computer Communications Network Topologies. In: Doukidis, G.I., Paul, R.J. (eds) Artificial Intelligence in Operational Research. Palgrave, London. https://doi.org/10.1007/978-1-349-12362-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-349-12362-9_8

  • Publisher Name: Palgrave, London

  • Print ISBN: 978-1-349-12364-3

  • Online ISBN: 978-1-349-12362-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics