An Investigation of Using Parallel Genetic Algorithm for Solving the Shortest Path Routing Problem

Problem statement: Shortest path routing is the type of routing widely used in computer network nowadays. Even though shortest path routing algorithms are well established, other alternative methods may have their own advantages. One such alternative is to use a GA-based routing algorithm. According to previous researches, GA-based routing algorithm has been found to be more scalable and insensitive to variations in network topologies. However, it is also known that GA-based routing algorithm is not fast enough for real-time computation. Approach: To improve the computation time of GA-based routing algorithm, this study proposes a coarse-grained parallel GA routing algorithm for solving the shortest path routing problem. The proposed algorithm is evaluated using simulation where the proposed algorithm is executed on networks with various topologies and sizes. The parallel computation is performed using an MPI cluster. Three different experiments were conducted to identify the best value for the migration rate, the accuracy and execution time with respect to the number of computing nodes and speedup achieved as compared to the serial version of the same algorithm. Results: The result of the simulation shows that the best result is achieved for a migration rate around 0.1 and 0.2. The experiments also show that with larger number of computing nodes, accuracy decreases linearly, but computation time decreases exponentially, which justifies the use parallel implementation of GA to improve the speed of GA-based routing algorithm. Finally, the experiments also show that the proposed algorithm is able to achieve a speedup of up to 818.11% on the MPI cluster used to run the simulation. Conclusion/Recommendations: We have successfully shown that the performance of GA-based shortest path routing algorithm can be improved by using a coarse-grained parallel GA implementation. Even though in this study the proposed algorithm is executed using an MPI cluster, the algorithm is also applicable to other parallel architecture such as multi-core CPU, multi-processor or GPGPU. A future work would be to evaluate the performance of the proposed algorithm on these other parallel architectures.

[1]  Surachai Panich The Shortest Path with Intelligent Algorithm , 2010 .

[2]  Masaharu Munetomo,et al.  Empirical investigations on the genetic adaptive routing algorithm in the Internet , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[3]  Hayder A. Mukhef,et al.  Generalized Shortest Path Problem in Uncertain Environment Based on PSO , 2008 .

[4]  D. E. Goldberg,et al.  Genetic Algorithm in Search , 1989 .

[5]  Aihua Li,et al.  Approach to the Shortest Path with Fuzzy Constraints by Simulated Annealing Algorithm , 2009, 2009 WRI Global Congress on Intelligent Systems.

[6]  M.E. El-Hawary,et al.  Hopfield-genetic approach for solving the routing problem in computer networks , 2002, IEEE CCECE2002. Canadian Conference on Electrical and Computer Engineering. Conference Proceedings (Cat. No.02CH37373).

[7]  Jianhua Ma,et al.  Parallel genetic algorithms for communication network design , 1997, Proceedings of IEEE International Symposium on Parallel Algorithms Architecture Synthesis.

[8]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[9]  Marin Golub,et al.  A new model of global parallel genetic algorithm , 2000, ITI 2000. Proceedings of the 22nd International Conference on Information Technology Interfaces (Cat. No.00EX411).

[10]  An Implementation of Genetic Algorithm in Matlab: Solution to the Route Choice Problem in the Urban Traffic Network , 2010, 2010 International Conference on Computational and Information Sciences.

[11]  F. de Toro,et al.  PSFGA: a parallel genetic algorithm for multiobjective optimization , 2002, Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing.

[12]  Ye Gao,et al.  Chaos Genetic Algorithm for Aircraft Route Planning Problem , 2010, 2010 Second WRI Global Congress on Intelligent Systems.

[13]  Myung-Mook Han Applying parallel genetic algorithm to sorting problem , 1999, FUZZ-IEEE'99. 1999 IEEE International Fuzzy Systems. Conference Proceedings (Cat. No.99CH36315).

[14]  Mir M. Atiqullah,et al.  Problem independent parallel genetic algorithm for design optimization , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[15]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[16]  Lipo Wang,et al.  Solving the Shortest Path Routing Problem Using Noisy Hopfield Neural Networks , 2009, 2009 WRI International Conference on Communications and Mobile Computing.

[17]  Chang Wook Ahn,et al.  A genetic algorithm for shortest path routing problem and the sizing of populations , 2002, IEEE Trans. Evol. Comput..

[18]  Chen Zhaoqiang,et al.  The Research of the Logistics Distribution Routing Optimization Based on Immune Genetic Algorithm , 2009, 2009 International Conference on Artificial Intelligence and Computational Intelligence.

[19]  Yang Chang,et al.  A novel hybrid algorithm for the dynamic shortest path problem , 2010, 2010 Sixth International Conference on Natural Computation.

[20]  Marina Yusoff,et al.  A discrete particle swarm optimization with random selection solution for the shortest path problem , 2010, 2010 International Conference of Soft Computing and Pattern Recognition.

[21]  David Taniar,et al.  A new parallel genetic algorithm , 2002, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02.

[22]  Qingquan Li,et al.  Multiobjective evacuation route assignment model based on genetic algorithm , 2010, 2010 18th International Conference on Geoinformatics.

[23]  S.E. Eklund,et al.  Time series forecasting using massively parallel genetic programming , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[24]  Ahmed A. A. Zakzouk,et al.  An ant colony optimization approach for solving shortest path problem with fuzzy constraints , 2010, 2010 The 7th International Conference on Informatics and Systems (INFOS).

[25]  J. Arunadevi,et al.  Intelligent Transport Route Planning Using Parallel Genetic Algorithms and MPI In High Performance Computing Cluster , 2007, 15th International Conference on Advanced Computing and Communications (ADCOM 2007).

[26]  Erick Cantú-Paz,et al.  Efficient and Accurate Parallel Genetic Algorithms , 2000, Genetic Algorithms and Evolutionary Computation.

[27]  Lai Soon Lee,et al.  Optimized Crossover Genetic Algorithm for Vehicle Routing Problem with Time Windows , 2010 .

[28]  Subbaraj Potti,et al.  Strength Pareto Evolutionary Algorithm based Multi-Objective Optimization for Shortest Path Routing Problem in Computer Networks , 2011 .

[29]  Salman Yussof,et al.  A Robust GA-based QoS Routing Algorithm for Solving Multi-constrained Path Problem , 2010, J. Comput..

[30]  Anton Riedl,et al.  A hybrid genetic algorithm for routing optimization in IP networks utilizing bandwidth and delay metrics , 2002, IEEE Workshop on IP Operations and Management.

[31]  Masaharu Munetomo,et al.  A migration scheme for the genetic adaptive routing algorithm , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[32]  A. Ourdighi,et al.  An Adaptive Time-delay Neural Network Training using Parallel Genetic Algorithms in Time-series Prediction and Classification , 2010 .