Introduction to Routing In Internet Seminar Topic:
The aim of this project is how routing is done in the internet. The basic operation includes finding a path from source to the destination. The packet may traverse many times because of large complex networks before reaching destination. Based on the link weight chance of getting in to the traffic. The process of sending and receiving includes when the data is transferred over internet the data is divided into packets.
The packets are assigned with header containing the destination ip address. These links are routed by the router. The data is first sent to router and incoming data packets are made to wait in queue. And the router determines the best way to transmit the packet to the destination ip address. The manual methods are often error prone and they are not scalable. The conditions of network are varied with time and the search algorithms. Thousands of optimization parameters are present if the network has highest OSPF link weightage.
Implementation of routing:
Find all possible routes between source and destination
Depending on the population size select some path as initial chromosome
The fitness evaluation is done by calculating fitness value of each chromosome
Fitness = no of hops * 10 – total cost of path
The parent is selected as randomly
The common point between the parents is found then they are crossover the parent paths are combined to form two new children paths. Based on fitness value off spring get selected
The nutation rate is 1% so this step was ignored
Population size = 4
Number of generations= 2
Crossover probability = 0.99
Mutation probability = 0.01
The shortest path is found by this routing algorithm. The algorithm mainly used in OSPF routing algorithm Which is used in IRP.
Download Routing In Internet CSE Seminar Report .