The process by which nodes exchange topological information to build correct forwarding tables.
A lowest cost path algorithm used in routing. Each node advertises reachability information and associated costs to its immediate neighbors, uses the updates it receives to construct its forwarding table. RIP uses it.