Discovering Simple Fault-Tolerant Routing Rules using Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.8612

@InProceedings{kirkam:1997:dsftrr,

• author = "I. M. A. Kirkwood and S. H. Shami and M. C. Sinclair",
• title = "Discovering Simple Fault-Tolerant Routing Rules using Genetic Programming",
• booktitle = "Artificial Neural Nets and Genetic Algorithms: Proceedings of the International Conference, ICANNGA97",
• year = "1997",
• editor = "George D. Smith and Nigel C. Steele and Rudolf F. Albrecht",
• pages = "285--288",
• address = "University of East Anglia, Norwich, UK",
• publisher = "Springer-Verlag",
• note = "published in 1998",
• email = "mcs@essex.ac.uk",
• keywords = "genetic algorithms, genetic programming, telecommunication networks, routing",
• ISBN = "3-211-83087-1",
• URL = "http://uk.geocities.com/markcsinclair/ps/icannga97_kir.ps.gz",
• DOI = "10.1007/978-3-7091-6492-1_62",
• size = "4 pages",
• 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.",
• notes = "http://www.sys.uea.ac.uk/Research/ResGroups/MAG/ICANNGA97/papers_frame.html",

}

Genetic Programming entries for I M A Kirkwood Sajjad Haider Shami Mark C Sinclair

Citations