Distance Vector Example: 4) Stability

• At this point, routing in the network is stable

• • Routing updates will continue, periodically
  • No changes made because shorter paths cannot be found

• When multiple equal-cost paths exist, only the first will be used

• • Update algorithm
  • • if newcost(X,Y) < oldcost(X,Y) then oldcost(X,Y) = newcost(X,Y)

• As long as the network is stable, distance vector protocols work reasonably well

• • When an outage occurs, they may take a while to converge, if at all!