الفهرس 
INTRODUCTIONOnly 14 pages are availabe for public view
 |  | from | 31 |  |  |
| | | from | 31 | | |
Abstract
With the growth of the Internet, Internet Service Providers (ISPs) try to meet the increasing demand with new technology and improved utilization of existing resources. Routing of data packets can affect network utilization. It determines the path of Packets sent along network paths from source to destination according to protocol Open Shortest Path First (OSPF) which is the most commonly used intra-domain Internet routing protocol (IRP). It routes the Traffic flow along the shortest path between the source and the destination nodes. Link weights are assigned by the network operator. A path length is the sum of the weights of the links in the path.This report recommends using a genetic algorithm to solve a network routing protocol problem, The algorithm has to find the shortest path between the source and destination nodes. In the literature, the routing problem is solved using search graph techniques to 5nd the shortest path. Dijkstra’s algorithm is one of popular techniques to solve this problem. The used genetic algorithm is compared with Dijkstra’s algorithm to solve routing problem. Simulation results are carried out for both algorithms using MATLAB. The results affirmed the potential of the genetic algorithm. The obtained performance is similar to the Dijkstra’s algorithm.