Distance Vector vs Link State Routing Protocol

Distance Vector:

•                    Distance Vector exchanges the routing updates periodically whether the topology is change or not, this will maximize the convergence time which increases the chance of routing loops.
•                    Secondly, the Distance Vector routing protocols rely on the information from their directly connected neighbors in order to calculate and accumulate route information                   
•                    Distance Vector routing protocols require very little overhead as compared to Link State routing protocols as measured by memory and processor power
•                    Routing Information Protocol (RIP) and Interior Gateway Routing Protocol (IGRP) are the examples of Distance Vector routing protocols

 Link State:

•                    Link State routing protocols send triggered change based updates when there is a topology change. After initial flood, pass small event based triggered link state updates to all other routers. This will minimize the convergence time that's why there is no chance of routing loops.
•                    Link State routing protocols do not rely solely on the information from the neighbors or adjacent router in order to calculate route information.
•                   Link State routing protocols have a system of databases that they use in order to calculate the best route to destinations in the network. An extra feature of Link State routing protocol is that they can detect media types along with other factors. This could increase the overhead as compare to Distance Vector routing protocols in order to measure by processor power and memory
•                    Open Shortest Path First (OSPF) is a classic example of Link State routing protocols.