Ethernet
September 12, 2024Computer-Networks
September 12, 2024Routing
| Question 4 |
Two popular routing algorithms are Distance Vector(DV) and Link State (LS) routing. Which of the following are true?
-
- (S1) Count to infinity is a problem only with DV and not LS routing
-
- (S2) In LS, the shortest path algorithm is run only at one node
-
- (S3) In DV, the shortest path algorithm is run only at one node
- (S4) DV requires lesser number of network messages than LS
| S1, S2 and S4 only | |
| S1, S3 and S4 only | |
| S2 and S3 only | |
| S1 and S4 only |
Question 4 Explanation:
→ Count to infinity problem only exist into the DVR.
→ In LSR shortest path is calculated at each every router. (B) is wrong.
→ In DVR also shortest path is calculated at each and every router. (C) is wrong.
→ Since DVR is based upon local knowledge whereas LSR is based upon global knowledge.
→ In LSR shortest path is calculated at each every router. (B) is wrong.
→ In DVR also shortest path is calculated at each and every router. (C) is wrong.
→ Since DVR is based upon local knowledge whereas LSR is based upon global knowledge.
Correct Answer: D
Question 4 Explanation:
→ Count to infinity problem only exist into the DVR.
→ In LSR shortest path is calculated at each every router. (B) is wrong.
→ In DVR also shortest path is calculated at each and every router. (C) is wrong.
→ Since DVR is based upon local knowledge whereas LSR is based upon global knowledge.
→ In LSR shortest path is calculated at each every router. (B) is wrong.
→ In DVR also shortest path is calculated at each and every router. (C) is wrong.
→ Since DVR is based upon local knowledge whereas LSR is based upon global knowledge.
Subscribe
Login
0 Comments