pg3 - paths to different gateway routers. RIP Routing...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
o DV algorithm can converge very slowly and have routing loops.  o DV algorithm can be affected more by false link states because it advertises to all neighbors  its distance vector. o LS is more robust because each node only computes its own routing table or least cost path. Internet Routing Autonomous systems – groups of routers that have their own intra-AS routing protocol. Different AS’s can have different intra-AS routing protocols. Each AS has one or more gateway routers which are responsible for forwarding the packets outside the  AS network. Hot Potato Routing – if AS1 learns from AS2 via inter-AS routing protocol that subnet x is reachable  via AS3 through multiple gateway routers than AS1 forwards its packet to AS2 which will forward  the packet to AS3.  AS3 can propagate the info to all intra-AS routers. The min least cost path will be chosen among the 
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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 Dijkstras shortest path algorithm. Broadcasts 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

Ask a homework question - tutors are online