Dynamic Routing Protocols Part- II

6: What is a distance vector routing protocol?

* A distance vector protocol is a routing protocol in which each router calculates routes based on the routes of its neighbors and then passes its routes to other neighbors.

7: Name several problems associated with distance vector protocols.

* Several problems associated with distance vector protocols are:

-> A susceptibility to incorrect routing information because of its dependence on neighbors for correct information
-> Slow convergence
-> Route loops
-> Counting to infinity

8: What are neighbors?

* Neighbors are routers connected to the same data link.

9: What is the purpose of route invalidation timers?

* Route invalidation timers delete routes from a route table if they exceed a certain age.

10: Explain the difference between simple split horizon and split horizon with poisoned reverse.

* Simple split horizon does not send route information back to the source of the route information.
Split horizon with poisoned reverse sends the information back to the source but sets the metric to unreachable.