Distance Vector Routing: overview

Iterative, asynchronous: each local iteration caused by:

• local link cost change

• message from neighbor: its least cost path change from neighbor

Distributed:

• each node notifies neighbors only when its least cost path to any destination changes

  • neighbors then notify their neighbors if necessary

Each node:

Previous slide

Next slide

Back to first slide

View graphic version