- Shuffle
Toggle OnToggle Off
- Alphabetize
Toggle OnToggle Off
- Front First
Toggle OnToggle Off
- Both Sides
Toggle OnToggle Off
Front
How to study your flashcards.
Right/Left arrow keys: Navigate between flashcards.right arrow keyleft arrow key
Up/Down arrow keys: Flip the card between the front and back.down keyup key
H key: Show hint (3rd side).h key
![]()
PLAY BUTTON
![]()
PLAY BUTTON
![]()
5 Cards in this Set
- Front
- Back
|
Each router receives a routing table from its directly
|
connected neighbor routers
|
|
The algorithm eventually accumulates network distances so that it can
|
maintain a database of network topology information
|
|
the distance vector algorithm does not allow a router to know the exact topology of an internetwork since each
|
router only sees its neighbor routers
|
|
Each router that uses distance vector routing first
|
identifies its neighbors
|
|
The interface that leads to each directly connected network has
|
a distance of 0
|