Distance Vector Routing Algorithm

iterative:

• continues until no nodes exchange info.

• self-terminating: no “signal” to stop

asynchronous:

• nodes need not exchange info/iterate in lock step!

distributed:

• each node communicates only with directly-attached neighbors

Distance Table data structure

• each node has its own

• row for each possible destination

• column for each directly-attached neighbor to node

• example: in node X, for dest. Y via neighbor Z:

Previous slide

Next slide

Back to first slide

View graphic version