Discussion
Consider the routing protocols given in List I and the names given in List II:
| List I | List II |
|---|---|
| (i) Distance vector routing | (a) Bellman-Ford |
| (ii) Link state routing | (b) Dijkstra |
For matching of items in List I with those in List II, which ONE of the following options is CORRECT?
Answer: A
The correct matching is (i) - (a) and (ii) - (b).
In distance vector routing (as in RIP), each router keeps a vector of distances and repeatedly updates it from its neighbours' vectors. That is the distributed Bellman-Ford algorithm.
In link state routing (as in OSPF), each router floods its link states, so every router learns the whole topology and then computes shortest paths from itself with Dijkstra's algorithm.
The options pairing both protocols with the same algorithm, or swapping them, mix up the local, iterative update of distance vector routing with the global, single-source computation of link state routing.
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development