CS455 Sylabus

The Distance Vector Routing Algorithm --- round 2 message exchange

• Example Distance Vector Routing

• Suppose node A transmits updates next:

Which will cause the following updates in tables of node B, C, E and F:

• Suppose node B transmits updates next:

 (I will skip the message figure from now on....)

This will cause the following updates in tables of nodes B, C, E and F:

• Suppose node C transmits updates next:

This will cause the following updates in tables of nodes A, B, and D:

• Suppose node D transmits updates next:

This will cause the following updates in tables of nodes C, and G:

• Suppose node G transmits updates next:

This will cause the following updates in tables of nodes D, and F:

• Suppose node F transmits updates next:

This will cause the following updates in tables of nodes A, and G:

NOTE:

 There are no changes in the values of the distance tables in nodes A and G Therefore, no update messages need to be schedule (sent) !!!

NOTE:

 Other nodes (i.e., other than nodes A and G) may still have updates scheduled...

• Suppose node E transmits updates next:

This will cause the following updates in tables of node A:

• This is the converged state

• You can try make some node sending its distance vector to its neighbors

The computation (triggered by the distance vector will not change the distance table any further...

• Convergence !!!.....