|  | 11.3 | Distance-Vector Routing
| 11.3.2 |
How distance-vector protocols exchange routing tables
Each router that uses distance-vector routing begins by identifying its own neighbors. In the Figure, the port that leads to each directly-connected network is shown as having a distance of 0. As the distance-vector network discovery process proceeds, routers discover the best path to destination networks based on the information they receive from each neighbor. For example, Router A learns about other networks based on the information that it receives from Router B. Each of the other network entries in the routing table has an accumulated distance vector to show how far away that network is in a given direction.