By Topic

Design of routing tables for a survivable military communications network using genetic algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. J. Moore ; Defence Commun. Services Agency, Corsham, UK ; M. C. Sinclair

One of the vital areas in the design and operation of a survivable military telecommunications network is the selection of its routing tables. Both a bit-string genetic algorithm (GA) and an iterative stochastic hill climber (ISHC) are applied to two problem scenarios: with and without existing routing tables. Experimental results are reported for one destination node in an 18-node model network. Comparisons are made both between the GA and ISHC approaches, and with the preexisting routing table. Overall, both the GA and the ISHC provide substantial improvements over the existing routing table, for both problem scenarios. However, the ISHC consistently obtains better results than the GA, often at reduced computational cost

Published in:

Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on  (Volume:3 )

Date of Conference: