Unformatted text preview: paths to different gateway routers. RIP – Routing Information Protocol • Uses hop count as the counting metric. Shortest path consists of least number of hops from a router to a destination subnet. • Each link has a value of one. • Distance Vector type algorithm • Usually used in lower tier ISPs. OSPF – Open Shortest Path First • Dijkstra’s shortest path algorithm. • Broadcast’s link state to all routers within an AS. • Multiple shortest paths can be used to send a load of data if they are equal in value. • Hierarchal Routing is possible using areas which contain their own OSPF routing algorithm. Area border routers are responsible for forwarding data outside of own area. Backbone area runs an inter-OSPF protocol to move data between OSPF areas. • Boundary Router performs BGP to communicated with outside AS routers....
View Full Document
This note was uploaded on 02/05/2009 for the course ECE 4450 taught by Professor Wicker during the Fall '07 term at Cornell.
- Fall '07
- Computer Networks