Home‎ > ‎May 2014‎ > ‎

02.May_2014_IJEECS_p21583

Genetic Algorithm Based Routing Algorithm for Packet Switching Network

Authors: Olalekan Ogunbiyi, Wasiu Akande

Abstract:

The distributed nature of routers in a packet switching network (PSN) and the need for them to send packet to one another following an optimal path make routing algorithm a necessity. In this paper, genetic algorithm (GA) is proposed to solve routing problem in a PSN. Computer simulation showed that GA approach obtain a result similar to Dijkstra’s algorithm (used in routing information protocol (RIP)) but with some improvement. The GA technique finds the optimal path between any source and destination nodes in a network. The network may be simple or complex, such that a feasible path or optimal path seems intractable. The developed technique was able to determine an entire route right from the source node, quick adaptation to changes in the network. It can also handle a numerous number of different constraints in the network. The binary coding used will also make it easier to implement in hardware.


Keywords:

Routing, packet switching network, metric, genetic algorithm and Dijkstra’s algorithm

Volume 20, Issue 1, May 2014, pp. 911-917                    Download PDF



References:
[1] S. Willian “Data and Computer Communication”, 8th Edition, Pearson Prentice Hill, Pearson Education Inc.: Upper Saddle River, 2003.
[2] S. Y. Anddrew, “Computer Networks”, Prentice – Hall, Inc.: New Jersey, 2004.
[3] M. W. Curt, “Data Communication and Computer Network”, Thomas place: Boston Massachusetts, 2007.
[4] L. Peterson and D. L. Bruces, “Computer Network”, 3rd Edition, Morgan Kaufmann Publishers: USA, 2003.
[5] A. F. Behrouz, Data Communication and Networking, McGraw-Hill Companies: NY, 2003.
[6] A. T. Hamdy, “Operation Research: An Introduction”, 8th Edition, Pearson Pentice Hill: Delhi India, 2007.
[7] L. Rhyd, “An Introduction to Metaheuristic Algorithms and the Problems they (try to) Solve”, Talk at the British Computing Society Lecture, Cardiff School of Mathematics / Cardiff Business School, 2008.
[8] The Math Works, “Genetic Algorithm and Direct Search Toolbox”, The Math Works, Inc.: 3 Apple Hill Drive Natick, 2004
[9] H. K. Foza, K. Nasiruddin, I. Syed & T. N. Shaikh, “Solving Travelling Salesman Problem(TSP) by Using Genetic Algorithm”, International Journal of Basic and Applied Science IJBAS, Vol: 9 No:10, Page 79-88, 2009.
[10] S. B. Aslaug, “Solving the Vehicle Routing Problem with Genetic Algorithm”, Information and Mathematical Modeling, IMM technical University of Denmark, pp. 1-127, 2004.
[11] K. Rakesh and K. Mahesh, “Exploring Genetic Algorithm for Shortest Path Optimization in Data Networks”, Global Journal of Computer Science and Technology (GJCST), Vol. 10, Issue 11 (Ver. 1.0), pp. 8-12, 2010.
[12] N. Gihan and G. A. Wahied, “Network Routing Protocol using Genetic Algorithms”, International Journal of Electrical & Computer Sciences IJECS-IJENS Vol:10 No:02, 2010.
[13] K. Amit, “Computational Intelligence: Principles, Techniques and Applications”, Springer-Verlag: Berlin Heidelberg, New York, 2005.
[14] C. Kelly and C. Kelly, “Guide to cisco networking”, 3rd edition, Thomas learning: Massachusetts, 2004.
[15] M. R Masillamani, V. S. Avinankumar, P. Rajesh, and G.V. Uma, “Genetic Algorithm for Distance Vector Routing Technique”, AIML 06 International Conference, 13 - 15 June 2006, pp. 171-174.
[16] M. Mitchell, “An Introduction to Genetic Algorithms”, Fifth Printing, MIT Press Cambridge: Massachusetts, 1999.
[17] G. L. David, “Linear and Nonlinear Programming”, Third Edition, Springer Science + Business Media: New York, 2008.
[18] K. Erwin, Advance Engineering Mathematics, 9th Edition, John Wiley & Son: NJ, 2006.
[19] A. M. Saad, M. Mohammad and N. A. Amer, “Hybrid Dynamic Routing Protocol For Finding an Optimal Path to Routers”, International Journal Of Academic Research, Vol. 3, No. 2, Part IV, 2011.
[20] N. Selvanathan and J. T. Wee, “A Genetic Algorithm Solution to Solve the Shortest Path Problem in OSPF and MPLS”, Malaysian Journal of Computer Science, Vol. 16, No. 1, pp. 58-67, 2003.
[21] L. Suihong, A. N. Zincir, and I. H. Malcolm, “Intelligent Packets for Dynamic Network Routing Using Distributed Genetic Algorithm”, Proceeding of the Genetic and Evolutionary Computation Conference, Morgan Kaufmann Publishers Inc.: San Francisco, CA, 2002.
[22] M. Zbigniew, “Genetic Algorithm + Data Structures + Evolution Programs”, Springer-Verlag Berlin Heidelberg: New York, 1996. [23] W. A. Chang and R. S. Ramakrishna, “A Genetic Algorithm for Shortest Path Routing Problem and the Sizing of Populations”, IEEE Transactions on Evolutionary Computation, Vol. 6, No. 6, pp. 566-579, 2002.