Click the Exhibit button.
Referring to the exhibit, which path would traffic passing through R1 take to get to R4?
JN0-664 Exam QuestionsBrowse all questions from this exam
JN0-664 Exam - Question 21
Show AnswerHide Answer
Correct Answer: A
Considering the OSPF cost of each path, the goal is to find the path with the lowest total cost. The paths from R1 to R4 and their total costs are as follows: R1 -> R3 -> R4 with a cost of 5 + 10 = 15, R1 -> R2 -> R4 with a cost of 15 + 10 = 25, and R1 -> R2 -> R3 -> R4 with a cost of 15 + 5 + 10 = 30. Therefore, the shortest and most cost-effective path is R1 -> R3 -> R4 with a total cost of 15.
Discussion
4 commentsM80TOption: C
Jan 10, 2024The OSPF cost is carried in the LSAs that are exchanged within an OSPF area. When a router calculates the cost to a destination it uses the cost of the exit interface of each router in the path to the destination.
Koee
Jan 7, 2024Anyone can explain this for me?
augustgg21
Jan 9, 2024only see the outgoing interfaces
zineeddineOption: C
Mar 3, 2024C is the shortest path