Study your flashcards anywhere!

Download the official Cram app for free >

  • Shuffle
    Toggle On
    Toggle Off
  • Alphabetize
    Toggle On
    Toggle Off
  • Front First
    Toggle On
    Toggle Off
  • Both Sides
    Toggle On
    Toggle Off
  • Read
    Toggle On
    Toggle Off
Reading...
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

A key: Read text to speech.a key

image

Play button

image

Play button

image

Progress

1/5

Click to flip

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