Reading...
Play button
Play button
Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
5 Cards in this Set
- Front
- Back
|
As the distance vector discovery process proceeds, routers discover the best path to destination networks based on
|
the information they receive from each neighbor
|
|
|
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
|
|
|
As with the network discovery process, topology change updates proceed
|
step-by-step from router to router
|
|
|
Distance vector algorithms call for each router to send its entire routing table to
|
each of its adjacent neighbor
|
|
|
The routing tables include information about the total path cost as defined by its metric and the logical address of
|
the first router on the path to each network contained in the table
|
