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.