Routing
September 7, 2024IP-Header
September 7, 2024Routing
|
Question 36
|
What is the routing algorithm used by RIP and IGRP ?
|
OSPF
|
|
|
Link-state
|
|
|
Dynamic
|
|
|
Dijkstra vector
|
|
|
None of the above
|
Question 36 Explanation:
→ The distance vector algorithm was the original ARPANET routing algorithm and was implemented more widely in local area networks with the Routing Information Protocol (RIP).
→ Interior Gateway Routing Protocol (IGRP) is an advanced distance-vector routing protocol that is used on a computer network for automating routing decisions and configuration.
Note: Dijkstra’s algorithm used for List State Routing(LSR). They given Dijkstra vector instead of distance vector. Excluded for evaluation.
→ Interior Gateway Routing Protocol (IGRP) is an advanced distance-vector routing protocol that is used on a computer network for automating routing decisions and configuration.
Note: Dijkstra’s algorithm used for List State Routing(LSR). They given Dijkstra vector instead of distance vector. Excluded for evaluation.
Correct Answer: E
Question 36 Explanation:
→ The distance vector algorithm was the original ARPANET routing algorithm and was implemented more widely in local area networks with the Routing Information Protocol (RIP).
→ Interior Gateway Routing Protocol (IGRP) is an advanced distance-vector routing protocol that is used on a computer network for automating routing decisions and configuration.
Note: Dijkstra’s algorithm used for List State Routing(LSR). They given Dijkstra vector instead of distance vector. Excluded for evaluation.
→ Interior Gateway Routing Protocol (IGRP) is an advanced distance-vector routing protocol that is used on a computer network for automating routing decisions and configuration.
Note: Dijkstra’s algorithm used for List State Routing(LSR). They given Dijkstra vector instead of distance vector. Excluded for evaluation.