Consider a network with 6 routers R1 to R6 connected with links having weights…

GATE · 2010 · CS · Computer Science & IT

Consider a network with 6 routers R1 to R6 connected with links having weights as shown in the following diagram

All the routers use the distance vector based routing algorithm to update their routing tables. Each router starts with its routing table initialized to contain an entry for each neighbour with the weight of the respective connecting link. After all the routing tables stabilize, how many links in the network will never be used for carrying any data?

  1. A.

    4

  2. B.

    3

  3. C.

    2

  4. D.

    1

Attempted by 274 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…