Selecting Among Neighbors

• if the set of acceptable neighbors is not empty, select the acceptable neighbor k that minimizes:

  • l[k] + d[k,j]

• if the set is empty, must engage in “diffusion” computation during which route entry for the destination j is frozen (not able to be updated)

Previous slide

Next slide

Back to first slide

View graphic version