Chapter 5, Problem R3RQ

Explanation of Solution

Difference between centralized and distributed routing algorithm:

Centralized routing algorithm	Distributed routing algorithm
Centralized routing algorithm calculates the least-cost path between the source and destination by reviewing overall knowledge about the network which is under computation.	Distributed routing algorithm calculates the least-cost path in the distributed manner by the routers.
It requires entire knowledge about the connectivity between all nodes and also needs the link’s cost.	The node available in the distributed routing algorithm does not have information about the network link cost and so the algorithm does not have the knowledge about the link cost.
The calculation will be processing at one side or it could be replicate in the routing component of the other available router.	Each node starts with only the knowledge of the cost of its own directly attached links. It uses an iterative process and through information exchange with the neighboring nodes to calculates the least-cost path to a destination.
Link state algorithm stands as an example for centralized routing algorithm...