Question
Consider the following three statements about link state and distance vector routing protocols, for a large network with 500 network nodes and 4000 links [S1] The computational overhead in link state protocols is higher than in distance vector protocols. [S2] A distance vector protocol (with split horizon) avoids persistent routing loops, but not a link state protocol. [S3] After a topology change, a link state protocol will converge faster than a distance vector protocol. Which one of the following is correct about S1, S2, and S3?
More IT Networking Questions
- Which network layer protocol is used to report errors and diagnose network problems?
- The attributes that do not exist in the physical database
- Which of the following function is used in every hashing technique
- What is a default route in routing?
- Which tool is used to build data pipelines and workflows in Hadoop-based systems?
- syntax of loops in shell scripting?
- 'Penetration testing' is:
- What is the purpose of the subnet mask in IP addressing?
- Which backup strategy involves rotating backup media to ensure data redundancy and off-site storage?
- Which protocol is used to automatically assign IP addresses to devices when they join a network?
Relevant for Exams:
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)