Optimization Criteria
Each router minimizes the cost to each destination by selecting a particular neighbor x that minimizes:
- cost to j = l[x] + d[x,j]
If an update l’[k] or d’[k,j] arrives such that (l’[k] + d’[k,j]) < (l[x]+d[x,j]):
- adopt k as new next hop and announce to neighbors (shorter is always ok)