IS path vector routing algorithm closer to the distance vector rou.pdf
0 likes12 views
The path-vector routing algorithm is a variant of distance-vector routing, utilizing the best path rather than direct distance as its metric. Nodes create forwarding tables, initially relying on direct neighbors for data. Over time, these tables improve as additional path vectors are received from neighbors.
1 of 1
Download to read offline
IS path vector routing algorithm closer to the distance vector rou.pdf
- 1. : IS path vector routing algorithm closer to the distance vector routing algorithm or to the link state routing algorithm? Explain. Solution The path-vector routing algorithm is truly distance-vector routing using the finest path instead of the direct distance as the metric. Each node first create a forwarding table. Assuming it can only arrive at instant neighbors . The forwarding table is slowly better as path vectors turn up from the instant neighbors.