ExamGecko
Question list
Search
Search

Question 8 - JN0-280 discussion

Report
Export

How does OSPF calculate the best path to a particular prefix?

A.

It finds the path with the numerically lowest cost.

Answers
A.

It finds the path with the numerically lowest cost.

B.

It finds the path with the shortest autonomous system path.

Answers
B.

It finds the path with the shortest autonomous system path.

C.

It finds the path with the least number of hops.

Answers
C.

It finds the path with the least number of hops.

D.

It finds the path with the numerically lowest route preference.

Answers
D.

It finds the path with the numerically lowest route preference.

Suggested answer: A

Explanation:

OSPF (Open Shortest Path First) calculates the best path based on the cost of the route, which is derived from the bandwidth of the interfaces along the path.

Step-by-Step Breakdown:

OSPF Path Selection:

OSPF assigns a cost to each link, typically based on the link's bandwidth (higher bandwidth equals lower cost).

The OSPF algorithm computes the shortest path to a destination by adding the costs of all links in the path. The path with the numerically lowest total cost is chosen as the best path.

Cost Calculation:

The OSPF cost can be manually adjusted or automatically calculated using the default formula:

Cost=ReferenceBandwidthLinkBandwidth\text{Cost} = \frac{\text{Reference Bandwidth}}{\text{Link Bandwidth}}Cost=LinkBandwidthReferenceBandwidth

Juniper

Reference:

OSPF Best Path Selection: OSPF selects the path with the lowest cumulative cost, ensuring efficient use of higher-bandwidth links in Junos networks.

asked 10/10/2024
Paul Walker
41 questions
User
Your answer:
0 comments
Sorted by

Leave a comment first