Discovering Simple Fault-Tolerant Routing Rules by Genetic Programming
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.
KeywordsShort Path Genetic Programming Current Node Link Failure Parse Tree
Unable to display preview. Download preview PDF.
- M. Gondran and M. Minoux. Graphs and Algorithms. John Wiley & Sons, Chichester, 1994.Google Scholar
- 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
- J.R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, 1992.Google Scholar
- 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
- W.A. Tackett and A. Carmi. Simple Genetic Programming in C. 1993.Google Scholar
- P.A. Whigham. Inductive bias and genetic programming. In Proc. GALESIA’ 95, pages 461–466, London, 1995.Google Scholar
- D. Zongker and B. Punch. Lil-GP 1.0 User’s Manual. Michigan State University, 1995.Google Scholar