Skip to main content

A Genetic Algorithm for Designing Networks with Desirable Topological Properties

  • Conference paper
  • 286 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1596))

Abstract

The network design problem discussed in this paper deals with optimising network parameters that characterise the following topologies: ring, chordal ring, torus and hypercube. These topologies have known, advantageous characteristics that may be useful in a final solution. By devising a system that can measure the extent to which an arbitrary mesh approaches these topologies multi-objective genetic algorithms that include topology as a dimension can be developed. Multi-objective genetic algorithms allow the designer to choose the ’ideal’ design from a pareto-optimal surface. This paper describes a method by which such a measure can be obtained for a topology from a set of network parameters namely: minimum hop count, node eccentricity, node degree and the number of links. In order to prove that these measures are effective in the context of a genetic algorithm, test results are given for applying these measures as part of a fitness function for evolving the specified topologies from an ’arbitrary’ mesh network. The results obtained show that the measures used are suitable for measuring the extent to which an arbitrary mesh matches a known topology, within a fitness function. As a consequence the designer can be guaranteed a range of acceptable but different choices.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Maxemchuck, N.F.: Routing in the Manhattan Street Network. IEEE Transactions on Communications COM- 35(5) (May 1987)

    Google Scholar 

  2. Maxemchuck, N.F.: Regular Mesh Topologies in Local and Metropolitan Area Networks. AT&T Technical Journal 64(7) (September 1985)

    Google Scholar 

  3. Robertazzi, T.G.: Toroidal Networks. IEEE Communications Magazine 26(6) (June 1983)

    Google Scholar 

  4. Chartrand, G., Lesniak, L.: Graphs and Digraphs, 3rd edn. Chapman & Hall, Boca Raton (1996)

    MATH  Google Scholar 

  5. Sinclair, M.C.: Minimum Cost Topology Optimisation of the COST 239 European Optical Network. In: Proceedings of the Second International Conference on Artificial Neural Networks and Genetic Algorithms, Alés, France, April 1995, pp. 26–29 (1995)

    Google Scholar 

  6. Sinclair, M.C.: NOMaD: Applying a Genetic Algorithm/Heuristic Hybrid Approach to Optical Network Topology Design. In: Proceedings of the IEE Colloquium on Multiwavelength Optical Networks: Devices, Systems and Network Implementations, London (June 1998)

    Google Scholar 

  7. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading (1989)

    Google Scholar 

  8. Cahn, R.S.: Wide Area Network Design: Concepts and Tools for Optimization. Morgan Kaufman Publishers, San Francisco (1998)

    Google Scholar 

  9. Davis, L., Orvosh, D., Cox, A., Qiu, Y.: A Genetic Algorithm for Survivable Network Design. In: Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 405–415 (1993)

    Google Scholar 

  10. Davis, L., Coombs, S.: Genetic Algorithms and Communication Link Speed Design: Theoretical Considerations. In: Proceedings of the Second International Conference on Genetic Algorithms, pp. 252–256 (1987)

    Google Scholar 

  11. Kershenbaum, A.: Telecommunications Network Design Algorithms. McGraw-Hill, New York (1993)

    Google Scholar 

  12. Ko, K.T., Tang, K.S., Chan, C.Y., Man, K.F.: Packet switched Communication Network Designs using GA, Genetic Algorithms in Engineering Systems: Innovations and Applications. In: Conference Pub. No. 446, September 2-4 (1997)

    Google Scholar 

  13. Standish, T.A.: Data Structures, Algorithms and Software Principles in C. Addison Wesley, Reading (1995)

    MATH  Google Scholar 

  14. Tanenbaum, A.S.: Computer Networks, 3rd edn. Prentice/Hall International, Inc., Englewood Cliffs (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Webb, A., Turton, B., Brown, J. (1999). A Genetic Algorithm for Designing Networks with Desirable Topological Properties. In: Poli, R., Voigt, HM., Cagnoni, S., Corne, D., Smith, G.D., Fogarty, T.C. (eds) Evolutionary Image Analysis, Signal Processing and Telecommunications. EvoWorkshops 1999. Lecture Notes in Computer Science, vol 1596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10704703_14

Download citation

  • DOI: https://doi.org/10.1007/10704703_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65837-5

  • Online ISBN: 978-3-540-48917-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics