Routing and Switching

Which of the following are Dynamic Algorithm?
I. Distance vector Routing
II. Flooding Algorithm
III. Link State Routing
IV. Path Vector Algorithm

Consider the following network with 6 routers, R₁ to R₆ 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, Which of the following links of the network if goes down, does not cause count-to-infinity problem?

Identify the following valid statements pertaining to DVR (Distance Vector Routing Algorithm) ?

Consider a network systems having 4 routers P, Q, R and S as shown below. Initially, the routers use a distance vector routing, and use the number of hops as the distance metric.

Initially, link P-Q was down, and all routers agree P is unreachable. The link P-Q comes back up. Let ‘x’ be the number of exchange needed by router P to stabilize its table having distance to all other router in the network. Assume the routers all exchange messages at the same instant. After reaching a steady-state the link P-Q goes down again. Let ‘y’ be the number of exchanges need for all routers to concluded router P is unreachable. What are the values of ‘x’,’y’ respectively?