Optimal Routing Analysis With RIP and OSPF Deployment in WAN

Abstract : The goal of this project is to investigate the behavior of routing convergence. It begins with an explanation of IP addressing. The report discusses the two routing protocols: Routing Information Protocol (RIP) and Open Shortest Path First (OSPF) into great detail. The report then examines the structure of a routing table and the route selection process. In order to be practical in the investigation of the routing convergence, we perform an experiment that involved routers. It is assumed that an end customer requires redundancy for its Wide Area Network (WAN) connection. The customer purchases WAN connectivity from two different ISPs that are, running two different routing protocols hence routing information must be redistributed. We conduct the experiment such that network convergences under different failure situation are examined. We will also modify the timers of RIP and OSPF to inspect any improvement.

 EXISTING SYSTEM :

 RIP is an interior routing protocol that is based on Distance Vector routing. RIP uses hop count to calculate the best route. It is simple but has many drawbacks. RIP uses hop count as a cost metric for each link, and each link has a cost of 1. The maximum path cost is 15 so RIP is limited to use in ASs that are not larger than 15 hops. Every 30 seconds the router sends copy of the routing table to its neighbors. The routing table is updated whenever the network topology is changed; each router informs its adjacent neighbors about the updating in the routing table. When the router receives an update, first it compares the new route with the current routing table, then adds a new path to the routing table and informs its adjacent neighbors about the updating in the routing table.

 DISADVANTAGE :

 1. The network is restricted to the size of 15 hops due to the solution to the “count to infinity” problem. 2. The convergence is too slow.

 PROPOSED SYSTEM :

 When the path with the best route fails then it chooses alternative path to reach the corresponding destination. This occurs when there are number of alternative paths. Among the different alternative path it chooses the path with least number of nodes.

 ADVANTAGE :

 1. Easy to configure 2. Incase of equal hop count from source to destination, it load balances and deliver the packets in different routes.