350-501 MPLS and Segment Routing Practice Question
An engineer configures an RSVP-TE tunnel with a bandwidth of 100 Mbps and an explicit path that excludes a specific interface. The tunnel fails to come up. Which term describes the path computation method used by RSVP-TE to find a feasible path given these constraints?
Answer choices
Why each option matters
Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.
Correct answer & explanation
✓
CSPF (Constrained Shortest Path First)
CSPF (Constrained Shortest Path First) is the algorithm used by RSVP-TE to compute a path that satisfies constraints such as bandwidth, explicit path, and link affinities.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✗
SPF (Shortest Path First)
Why it's wrong here
SPF does not consider constraints beyond metric.
- ✗
Bellman-Ford
Why it's wrong here
Bellman-Ford is a distance-vector algorithm, not used for TE.
- ✓
CSPF (Constrained Shortest Path First)
Why this is correct
Correct: CSPF considers constraints.
- ✗
Dijkstra with ECMP
Why it's wrong here
Dijkstra is for SPF, not constrained.
Go deeper
Related to this question
About these practice questions
This 350-501 question is part of Courseiva's 971-question bank — original exam-style content with full explanations and wrong-answer analysis, never real exam questions or exam dumps. Learn why practice questions differ from exam dumps →
JA
Written by Johnson Ajibi, MSc IT Security
Senior Network & Security Engineer · founder of Courseiva
This 350-501 practice question is part of Courseiva's free Cisco certification practice question bank. Courseiva provides original exam-style practice questions with explanations, topic-based practice, mock exams, readiness tracking, and study analytics to help learners prepare for the 350-501 exam.