Skip to main content
SpringerLink
Log in

Discovering Simple Fault-Tolerant Routing Rules by Genetic Programming

  • Conference paper
Artificial Neural Nets and Genetic Algorithms

Abstract

A novel approach to solving network routing and restoration problems using the genetic programming (GP) paradigm is presented, in which a single robust and fault-tolerant program is evolved which determines the near-shortest paths through a network subject to link failures. The approach is then applied to five different test networks. In addition, two multi-population GP techniques are tried and the results compared to simple GP.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Gondran and M. Minoux. Graphs and Algorithms. John Wiley & Sons, Chichester, 1994.

    Google Scholar 

  2. W.D. Grover. The self-healing network: A fast distributed restoration technique for networks using digital cross-connect machines. In IEEE Global Conference on Communications, pages 1090–1095, 1987.

    Google Scholar 

  3. J.R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, 1992.

    Google Scholar 

  4. B. Punch, D. Zongker, and E. Goodman. The Royal Tree Problem, a Benchmark for Single and Multiple Population Genetic Programming, volume 2. MIT Press, 1996.

    Google Scholar 

  5. W.A. Tackett and A. Carmi. Simple Genetic Programming in C. 1993.

    Google Scholar 

  6. P.A. Whigham. Inductive bias and genetic programming. In Proc. GALESIA’ 95, pages 461–466, London, 1995.

    Google Scholar 

  7. D. Zongker and B. Punch. Lil-GP 1.0 User’s Manual. Michigan State University, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Electronic Systems Engineering, University of Essex, Wivenhoe Park, Colchester, Essex, CO4 3SQ, UK

    I. M. A. Kirkwood, S. H. Shami & M. C. Sinclair

Authors
  1. I. M. A. Kirkwood
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. H. Shami
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. C. Sinclair
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Wien

About this paper

Cite this paper

Kirkwood, I.M.A., Shami, S.H., Sinclair, M.C. (1998). Discovering Simple Fault-Tolerant Routing Rules by Genetic Programming. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6492-1_62

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6492-1_62

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-83087-1

  • Online ISBN: 978-3-7091-6492-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation