Distance vector in Networking

Q.  Which of the following statements is/are correct about distance vector?
- Published on 19 Oct 15

a. Router don’t knows the identity of other router.
b. Cost of each couple is not equal to destination.
c. Each router maintains a distance vector.
d. All of the above.

ANSWER: Each router maintains a distance vector.


  • Prajakta Pandit   -Posted on 12 Oct 15

    - In distance vector routing each node constructs a one-dimensional array containing the 'distances' (costs) to all other nodes and distributes that vector to its immediate neighbors.

    - The starting assumption for distance vector routing is that each node knows that the cost of the link to each of its directly connected neighbors.

    - Routing Information Protocol (RIP) and Interior Gateway Routing Protocol (IGRP) are two very popular distance vector routing protocols.

    - Each router maintains a distance vector it means each router will broadcast its entire routing table every 30 seconds.

    - Routing is based on distance vector that can cause a lot of problems when the links go up and down, this could result in infinite loops and can also desynchronize the network.

    - Routing loops can occur when every router is not updated close to the same time.

Post your comment / Share knowledge

Enter the code shown above:
(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)