A genetic-based fault-tolerant routing strategy for multiprocessor networks

  • Peter K. K. Loh
  • Venson Shaw
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1586)


We have investigated the adaptation of AI-based search techniques as topology-independent fault-tolerant routing strategies on multiprocessor networks [9]. The results showed that these search techniques are suitable for adaptation, as fault-tolerant routing strategies with the exception that the routes obtained were non-minimal. In this research, we investigate the adaptation of a genetic-heuristic algorithm combination as a fault-tolerant routing strategy. Our results show that such a hybrid strategy results in a viable fault-tolerant routing strategy, which produces minimal or near-minimal routes with a corresponding significant reduction in the number of redundant node traversals. Under certain fault conditions, this new hybrid routing strategy outperforms the purely heuristic ones.


Genetic Algorithm Destination Node Trunk Group Swap Mutation Individual Route 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Buckles, B.P., Petry, F.E., Kuester, R.L., “Schema survival rates and heuristic search in GAs”, 2nd Intl Conf Tools Art. Intelligence, ’90, pp322–327.Google Scholar
  2. 2.
    Chen, M. and Zalzala, A.M.S., “Safety considerations in the optimization of paths for mobile robots using genetic algorithms”, Proc. 1st Intl Conf. on Genetic Algorithms in Engring Systems: Innovations and Applications, 1995, pp 299–306.Google Scholar
  3. 3.
    Dally, J. and Seitz, C.L., Deadlock-Free Message Routing in Multiprocessor Interconnection Networks, IEEE Trans. Comput., VC36, N5, May 87, pp 547–553.Google Scholar
  4. 4.
    Goldberg, D.E., “Genetic and evolutionary algorithms come of age”, Communications of the ACM, Vol. 37, No. 3, March ’94, pp 113–119.Google Scholar
  5. 5.
    Jog, P., Suh, J. Y., and Van Gucht, D., “The Effects of Population Size, Heuristic Crossover and Local Improvement on a GA for Travelling Salesman Problem”, Proc. 1 st Intl Conf. Genetic Algorithms and Applications, July85, pp 110–115.Google Scholar
  6. 6.
    Korf, R.E., Encyclopedia of Artificial Intelligence, John Wiley, V2, 1987.Google Scholar
  7. 7.
    Lin, S., Punch, W.F., Goodman, E.D., “Coarse-grain parallel genetic algorithms: categorization and new approach”, Proc. Symp Par and Dist Proc, ’94, pp 28–37.Google Scholar
  8. 8.
    Loh, P.K.K., “Heuristic fault-tolerant routing strategies for a multiprocessor network, Microprocessors and Microsystems, V19, N10, Dec. 1995, pp 591–597.MathSciNetCrossRefGoogle Scholar
  9. 9.
    Loh, P.K.K., “Artificial intelligence search techniques as fault-tolerant routing strategies”, Parallel Computing, Vol 22, No, 8, October 1996, pp 1127–1147.zbMATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    Loh, P.K.K. and Wahab, A., “A Fault-Tolerant Communications Switch Prototype”, Microelectronics and Reliability, V37, N8, July 1997, pp 1193–1196.CrossRefGoogle Scholar
  11. 11.
    Sinclair, M.C., “Application of a Genetic Algorithm to Trunk Network Routing Table Optimisation”, IEE Proc. 10th UK Teletraffic Symp, April 93, pp 2/1–2/6.Google Scholar
  12. 12.
    Sinclair, M.C., “Trunk Network Fault-Tolerance through Network Augmentation”, Proc. 4th Bangor Symp on Comms, Bangor, May92, pp 252–256.Google Scholar
  13. 13.
    Sinclair, M.C., “Trunk Network Fault-Tolerance through Routing Table Updating in the Event of Trunk Failure”, Proc. 9th UK Teletraffic Symp, Apr92, pp 1–9.Google Scholar
  14. 14.
    Tay, K.P., “An Indestructible Worm”, P114-97, NTech. University, 1997.Google Scholar
  15. 15.
    De Jong, K.A. Spears, W.M., and Gordon, D.f., “Using genetic algorithms for concept learning”, Machine Learning, V13, No. 2-3, Nov–Dec. 1993, pp 161–188.CrossRefGoogle Scholar
  16. 16.
    Srinivas, M. & Patnaik, L.M., “GAs: a survey”, Computer, V27N6, Jun’94, pp17–26.Google Scholar
  17. 17.
    Srinivas, M. & Patnaik, L.M., “Adaptive probabilities of crossover and mutation in genetic algorithms”, Tran Sys, Man Cybernetics, V24 N4, Apr94, pp 656–667.Google Scholar

Copyright information

© Springer-Verlag 1999

Authors and Affiliations

  • Peter K. K. Loh
    • 1
  • Venson Shaw
    • 1
  1. 1.School of Applied ScienceNanyang Technological UniversitySingapore

Personalised recommendations