Distance Vector Routing Protocols
A distance-vector routing protocol requires that a router informs its neighbors of topology changes periodically and, in some cases, when a change is detected in the topology of a network. Compared to link-state protocols, which require a router to inform all the nodes in a network of topology changes, distance-vector routing protocols have less computational complexity and message overhead.
Wise man says : Let your life flow, you don't know what's upcoming. and detect the changes periodically
Link State Routing Protocols
The link-state protocol is performed by every switching node in the network. The basic concept of link-state routing is that every node constructs a map of the connectivity to the network, in the form of a graph, showing which nodes are connected to which other nodes. Each node then independently calculates the next best logical path from it to every possible destination in the network. The collection of best paths will then form the node's routing table
in link-state routing protocol, the packet may rerouted if that router knows the condition of full topology, or can be said as the big picture.
Wise man says : have you seen those big pictures before you decide to reroute?
Which One Are You ?
