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
- Hadoop is an open-source framework commonly used for processing and analyzing big data. What is the primary component of Hadoop responsible for distributed...
- In a B-tree, the minimum number of children a non-root internal node can have is:
- Which of the following algorithm is most sensitive to outliers?
- Physical address called as MAC address is associated with which layer?
- Why probe packets are transmitted in the network
- Which is the first process launched by the LINUX?
- What does a proxy firewall do?
- Which of the following shows the count of arguments passed to the script?
- A subnet has the network address 192.168.5.64/27. What is the broadcast address of this subnet?
- Which of the following is NOT a potential concurrency control issue?
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)