Evolving simple fault-tolerant routing rules using genetic programming
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.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Koza J.R. Genetic programming: On the programming of computers by means of natural selection MIT Press 1992
2.
Dijkstra E.W. A note on two problems in connexion with graphs Numer. Math. 1 269-271 1959
3.
Grover W.D. The selfhealing network: A fast distributed restoration technique for networks using digital cross-connect machines IEEE Global Conf. on Commun. 1987 1090-1095
4.
Kirkwood I.M.A., Shami S.H., and Sinclair M.C. Discovering simple fault-tolerant routing rules using genetic programming Intl. Conf. on Artificial Neural Networks and Genetic Algorithms 1997 Norwich, UK
5.
Zongker D. and Punch B. lil-gp 1.0 user's manual Michigan State University 1995
6.
Punch B., Zongker D., and Goodman E. Angeline P.J. and Kinnear K.E. Jr. The royal tree problem, a benchmark for single and multiple population genetic programming Advances in genetic programming Volume 2 MIT Press 1996
Information & Authors
Information
Published in
Copyright
© IEE.
History
Published in print: 14 August 1997
Published online: 14 March 2024
Inspec keywords
Keywords
Keywords
Authors
Metrics & Citations
Metrics
Citations
Download article citation data for:
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
View Options
Access content
Please select your options to get access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.