Informations

Auteur(s) Noah Van Horenbeke
Date limite Pas de date limite
Limite de soumission Pas de limite

Se connecter

0 - Fast Reroute and Segment Routing QCM

This quiz covers the theoretical foundations you will need for the lab that follows. After completing it, you will configure and debug a real SR-MPLS network with IS-IS and TI-LFA on Kathara.

Here are some useful links:


Question 1: MPLS vs SRv6: Where is the path encoded?

In Segment Routing, the source router encodes the path as a list of segments. What is the fundamental difference between SR-MPLS and SRv6 in terms of how this information is carried?

Question 2: Loop-Free Alternate condition

A router S wants to use neighbor N as a Loop-Free Alternate (LFA) to reach destination D after the link S→D fails.

Which condition must hold?

Question 3: LFA coverage on a square topology

Consider the following symmetric topology where all link costs are 10.

R1 ── R2
│      │
R4 ── R3

R1 wants to protect the link R1→R2. Can R4 act as an LFA for R1 to reach R2?

Apply the LFA condition: Distance(R4, R2) < Distance(R4, R1) + Distance(R1, R2)

Question 4: TI-LFA vs classic LFA

Which of the following statements are true about Topology-Independent LFA (TI-LFA) compared to classic LFA?

Question 5: P-space and Q-space

In the context of TI-LFA for protecting link R1→R2, which of the following best defines the Q-space?

R1 ── R2
│      │
R4 ── R3
Question 6: Diagnosing LFA/TI-LFA with FRR commands

After enabling isis fast-reroute ti-lfa on all interfaces in FRR, you want to verify that TI-LFA backup paths are correctly computed. Which commands are useful for this verification?

Question 7: Node protection vs link protection

What is the key difference between link protection and node protection in TI-LFA?

Question 8: Why load MPLS kernel modules?

On a standard Linux system, you configure FRR with IS-IS and Segment Routing. MPLS label forwarding does not work out of the box. Why, and what must you do first?

Question 9: LFA coverage count

Same symmetric square topology, all costs 10.

How many of the 8 directed links (4 bidirectional × 2 directions) can be protected by classic LFA (x1) and TI-LFA (x2)?

Write you answer with this format: x1,x2

Question 10: Link Failure

In this topology, after the link failure, wich path the Source will use to reach the Destination.

Link Failure topology
Question 11: Node Failure

In this topology, after the node failure, wich path the Source will use to reach the Destination.

Node Failure topology
Question 12: LFA Limitations

Consider the topology below and assume that link failure.

LFA not working example

With a classic LFA mechanism: