UofG Repository

Optimal Route Selection in Computer Network using Genetic Algorithm

Show simple item record

dc.contributor.author GISMALLA, HUYAM YOUNIS ABDALLA
dc.date.accessioned 2018-09-30T07:42:18Z
dc.date.available 2018-09-30T07:42:18Z
dc.date.issued 2018-05-05
dc.identifier.uri http://repo.uofg.edu.sd/handle/123456789/2057
dc.description A Dissertation Submitted to University of Gezira in Partial Fulfilment of the Requirements for the Degree of Master of Science in Computer Science, Department of Computer Science, Faculty of Mathematical and Computer Sciences, April, 2018 en_US
dc.description.abstract Due to huge demand of Internet, ISPs are trying to meet the increasing traffic demand with improved utilization of existing resources and application of new technologies. Routing is one of the most important issues that have a significant impact on the network's performance, the process of finding the optimal paths between nodes in network is a hard special in large networks because there are many potential intermediate destinations. Data routing in computer networks is a process of transferring packets from source node to destination node with minimum cost. Metaheuristic algorithms such as genetic algorithm is widely employed for solving the optimization problems. Genetic Algorithm is a metaheuristic method based on the mechanics of natural genetics and natural selection. The problem of finding a path with minimum cost between a given pair of nodes is one of the most fundamental problems in computer networks. The main objective of this research is to study existing solutions and to choose an appropriate method for solving the research problem and to evaluate the solution to find near optimal route from a single source node to destination node. The methodology solve this problem which formulated as a mathematical model. Many research works have been introduced alternative methods and techniques for solving shortest path problem in networks. This research proposes a solution based on genetic algorithm to find the near optimal solution for the SSP. The used genetic operators are tournament selection with elitism techniques, multipoint crossover and insertion mutation. The crossover operation exchanges partial chromosomes and the mutation operation maintains the genetic diversity of the population. The proposed algorithm has been tested using many instances of network and experimental results show that the proposed algorithm finds the path with minimum cost from a single source node to the destination node for any given network of different sizes (5, 6, and 30). In addition to that the results proved the usefulness of the GA in finding the near optimal solution for SPP. As future work it is recommended to combine the GA with simulated annealing algorithm for mutation to get faster diversity in larger network sizes. en_US
dc.description.sponsorship Awadallah Mohammed Ahmed Ali (Main Supervisor) Mohammed Albarra Hassan ( Co-supervisor) en_US
dc.language.iso en en_US
dc.publisher University of Gezira en_US
dc.subject Internet services en_US
dc.subject Transfer packets en_US
dc.subject Computer Science en_US
dc.title Optimal Route Selection in Computer Network using Genetic Algorithm en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account