Answer to Question #149035 in Java | JSP | JSF for Serk

Question

Analyse the operations, using illustration,of two network shortest path algorithms,providing the an example of each

Answer 1

The two Network shortest path algorithms are Distance Vector Routing protocol and Link State routing protocol.

Distance Vector Routing Protocol: This is the protocol which will calculate the distance between each source and every possible destination. They share information with the neighbors at a regular interval. The example for the above algorithm is the bellman ford algorithm.

Link State Routing Protocol: information is only shared between the neighbors only when the information has got changed. In this case, each router shares information with all the routers connected in the network. Dijkstra's algorithm is an example of this case