# L24 - Distance vector routing Related to the Bellman-Ford...

This preview shows pages 1–5. Sign up to view the full content.

Distance vector routing Related to the Bellman-Ford Algorithm. Let node 1 be the destination node. Find the shortest path from every node to node 1. i Define D as the cost (called “distance”) of the shortest h 1 path from i to 1 that uses at most h links. D = 0 for any h h. i Initially: D = 4 . 0 Iteratively, we find ii j j D = min [d + D ] for all i ± 1 h+1 h j and the new associated path from node i for h+1 is , for the minimizing j, the prior path from j to 1 in h steps augmented by the link from i to j.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
A router needs to know the direct cost to each of its attached neighbors. Also, each router maintains a table of its best known distance to each destination and the link to go to next. The estimated distance from the node j to jk destination k is D , and these numbers are reported to its neighbors for the next Bellman- Ford-like computation.
Node i directory Destination Est. Cost next node -- - - - An individual node does not need to know about the other parts of a route.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Cost is a tricky assignment in routing decisions.
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 07/16/2011 for the course EE 362 taught by Professor Unknow during the Spring '11 term at Penn College.

### Page1 / 13

L24 - Distance vector routing Related to the Bellman-Ford...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online