Consider the routing protocols given in List-I and the names given in List-II:

List-I:
(i) Distance vector routing
(ii) Link state routing

List-II:
(a) Bellman-Ford
(b) Dijkstra

For matching of items in List-I with those in List-II, which ONE of the following options is CORRECT?

The correct option is (i) – (a) and (ii) – (b).

To understand why this match is correct, let us analyze the routing protocols listed in List-I and the algorithms associated with them in List-II:

1. Distance Vector Routing:
Distance vector routing is an intra-domain routing protocol where each router maintains a routing table representing the best-known distance to each destination. These tables are updated by sharing information with immediate neighbors. The mathematical foundation of distance vector routing is the Bellman-Ford algorithm, which computes single-source shortest paths in a weighted graph. Therefore, item (i) matches with (a).

2. Link State Routing:
In link state routing, every router possesses complete knowledge of the network topology. Each router independently calculates the shortest path from itself to all other nodes in the network. The algorithm used to find these shortest paths on the complete network graph is Dijkstra's algorithm. Therefore, item (ii) matches with (b).

Combining these individual matches, we get:
(i) – (a) and (ii) – (b)