One of the main benefits of using link state protocols is the fast network convergence. Link State protocols respond immediately for any networks changes by employing triggered flooded updates, which report the changes once they occur. The complete and synchronized view for each protocol about the network makes it hard for routing loops to exist (McQuerry S. , 2008) . Additionally, link state protocols consume less bandwidth compared to Distance Vector protocols, as it does not engage periodic updates while maintaining the network. Likewise, the bandwidth efficiency has vital impact on network scalability, making link state protocols more appropriate for large and complex networks.
In contrast, the extensive use of databases such as neighbour table and Link State Table database, in addition to routing table require substantial amount of memory, moreover, it requires significant CPU power to run Dijkstra’s algorithm especially in large networks. Finally, it is quite complex to implement and troubleshoot compared to distance vector protocols.
