Question

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

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

• A. (i) – (a) and (ii) – (b)
• B. (i) – (a) and (ii) – (a)
• C. (i) – (b) and (ii) – (a)
• D. (i) – (b) and (ii) – (b)

Hint:

Distance vector routing relies on the Bellman-Ford algorithm to determine shortest paths, while link-state routing uses Dijkstra’s algorithm for efficient path computation.

Answer 1

The Correct Option is A

Distance Vector Routing:

• This protocol determines the best path for data packets based on distance (hop count).
• The Bellman-Ford algorithm is used in distance vector routing protocols such as RIP (Routing Information Protocol). This algorithm works by updating the routing table based on the distance to the destination, with each router periodically exchanging information with its neighbors.

Link State Routing:

• This protocol uses the Dijkstra algorithm to compute the shortest path. It works by having each router send information about its direct connections to all other routers in the network, so each router can calculate the shortest path to every destination.
• Each router maintains a complete view of the network topology. This enables more accurate and faster path computations but requires more memory and processing power compared to distance vector routing.
• Examples include OSPF (Open Shortest Path First) and IS-IS (Intermediate System to Intermediate System), both of which use link-state routing protocols to provide efficient routing in larger networks.

Since distance vector routing uses Bellman-Ford and link state routing uses Dijkstra, the correct answer is:

(A) (i) – (a) and (ii) – (b)