About this document

CN Unit 3 by hariniisubramanian is a document available to read on EtoBox.

Distance vector routing is a distributed algorithm where each node knows the cost to its directly connected neighbors and constructs a vector for routing information. Nodes periodically exchange their routing tables and update them based on received information, leading to convergence when all nodes have complete routing information. Updates can be periodic or triggered by changes in the network, such as link failures.

Author

hariniisubramanian

Language

EN