State the advantages and disadvantages of Link-state Routing, a typical example is Dijkstra's algorithm
The following are the advantages of the link-state routing protocol:
The primary benefit of the link-state routing protocol is its ability to achieve rapid network convergence. When link-state routing protocols obtain an LSP, they instantly stream the LSP from all connections, with the exception of the connection from whence the LSP was taken.
A topological map, also known as an SPF tree, is used to create the network topology in link-state routing. Each router may calculate the closest way to each connection by using SPF tree.
Link-state routing systems employ numerous regions and establish a hierarchical structure for network segments. The fact that there are various areas allows for better route summary.
Event-driven Upgrades: After the first flooding of LSPs, the LSPs are only transmitted when the topology changes, and they only include information about that change. Just the information about the impacted connection is contained in the LSP. Regular upgrades are never sent by the link-state.
The following are the drawbacks of the link-state routing protocol:
Storage Limitations. A directory and SPF tree are created and maintained by the link-state routing protocol. A dynamic routing protocol used less storage than databases and SPF tree.
Link-state routing protocols, such Bellman-Ford, need greater CPU performance since the SPF algorithm takes longer to run than distance-vector algorithms as link-state protocols generate a comprehensive map of the topology.
Prerequisites for Connectivity. The link-state routing protocol floods link-state packets during first start-up and also following events such as networking failure and routing protocol alterations, which influence a network's available capacity. If the connection isn't reliable, it can cause problems with the network's performance.
Comments
Leave a comment