Content deleted Content added
m clean up spacing around commas and other punctuation fixes, replaced: ,B → , B, ,C → , C, ,D → , D |
|||
Line 1:
{{short description|Class of routing protocols}}
{{Multiple issues|
{{More footnotes needed|date=September 2010}}
{{technical|date=November 2013}}
}}
Line 187:
|}
|-
|colspan=5| At this point, all the routers (A, B, C, D) have new "shortest-paths" for their DV (the list of distances that are from them to another router via a neighbor). They each broadcast this new DV to all their neighbors: A to B and C, B to C and A, C to A, B, and D, and D to C. As each of these neighbors receives this information, they now recalculate the shortest path using it.
For example: A receives a DV from C that tells A there is a path via C to D, with a distance (or cost) of 5. Since the current "shortest-path" to C is 23, then A knows it has a path to D that costs 23+5=28. As there are no other shorter paths that A knows about, it puts this as its current estimate for the shortest-path from itself (A) to D, via C.
| |||