CCNA Protocols – Rounting Protocols II

Distance -vector:-

·         In this technique it use distance -vector algorithm which uses a direction to any link in the interconnection network to determine the best route.

·         Each router periodically send information to the neighbor on the cost to get to distance node.

·         The main problem with distance -vector is that it updates the network step by step so it requires more bandwidth to process the information.

·         Problems with distance -vector

Different types of problems are.

·         Routing loops

·         Counting to infinity

·         Solutions

·         setting infinity values

·         split horizon

·         hold-down timers

·         same neighbor problem

·         different neighbor better metric

·         different neighbor poorer metric

Link state:-

·         It maintains a complex database on the topology of the network.

·         It uses the link state algorithm (LSA) to advertise the routing information from routers.

·         Each router built up a topological database with themselves at the top of the tree.

·         Routers keep communicating with neighbors at latest state.

Problem with link-state

·         It requires more processing power to communicate with each other.

·         It requires more memory to store LSA and topological database.

·         Link state updates

·         Scaling

·         It initially sends up high demand for updates.

Hybrid routing

·         It uses a combination of both balance and hybrid routing.

·         It uses distance -vector technique for more accurate metrics to determine the best path.

·         It reports routing information when change occurs in topology – link-state.

·         Intermediate system-to-intermediate system (IS-IS).

·         Enhance interior gateway routing protocol (EIGRP).

Related new:- CCNA Protocols – Rounting Protocols I,CCNA Protocols – Rounting Protocols