H12-831_V1.0 Exam Dumps : HCIP-Datacom-Advanced Routing & Switching Technology V1.0

Comprehensive and Detailed In-Depth Explanation:

Step 1: Understanding OSPF Areas and Summarization

Loopback0 on R5 has IP 10.0.5.5/32 and is advertised into OSPF.

The abr-summary 10.0.5.0 255.255.255.0 command is applied in area 2 on R1, which means:

Instead of advertising individual host routes (like 10.0.5.5/32), R1 advertises the summarized route 10.0.5.0/24 into Area 0 (Backbone).

This summarized route is then propagated into other areas via Area 0 (Backbone).

Step 2: Analyzing the Routing Table of Each Router

R5 (Originating Router in Area 2)

R5 only knows 10.0.5.5/32 because it's the originating router.

The abr-summary command does not affect R5 itself.

❌ R5 does not have 10.0.5.0/24.

R1 (ABR for Area 2, Summarizing the Route)

R1 creates and advertises 10.0.5.0/24 into Area 0.

This summary route is sent to other areas via Area 0.

R2 (Connected to Area 0 & Area 1)

Since R2 is part of Area 0 (Backbone), it receives 10.0.5.0/24 from R1.

✅ R2 has 10.0.5.0/24 in its routing table.

R3 (Connected to Area 0 & Area 2)

Since R3 is also connected to Area 0, it receives the summary route 10.0.5.0/24 from R1.

✅ R3 has 10.0.5.0/24 in its routing table.

R4 (In Area 1, which is not directly connected to Area 2)

R4 belongs to Area 1, and unless explicitly advertised through inter-area summarization, it will not have 10.0.5.0/24.

Since no specific mention of summary advertisement into Area 1 is made, R4 does not get 10.0.5.0/24.

❌ R4 does not have 10.0.5.0/24.

Final Answer: ✅ R2, R3 (Option B, C)

References:

HCIP-Datacom-Advanced Routing & Switching Technology V1.0 – OSPF Route Summarization

OSPF Inter-Area Route Advertisement via ABRs

OSPF Backbone (Area 0) Behavior and Route Distribution

Comprehensive and Detailed In-Depth Explanation:

To verify the correct answer, we need to analyze Bidirectional Forwarding Detection (BFD) behavior and the provided configuration.

1. Understanding BFD Configuration Parameters

BFD (Bidirectional Forwarding Detection) is a protocol used for fast failure detection between directly connected devices.

Key Configuration Parameters in BFD:

Peer IP (bind peer-ip)

This specifies the destination router’s IP address for the BFD session.

✅ Correctly configured on both R1 and R2.

Discriminator Local/Remote (discriminator local X / remote Y)

These values must match between the two routers.

✅ Correctly configured (R1: local 1, remote 2; R2: local 2, remote 1).

Min-TX Interval (min-tx-interval)

Defines the minimum transmit interval for BFD packets.

❌ Missing from R2’s configuration (could be a cause for mismatch).

Min-RX Interval (min-rx-interval)

Defines the minimum receive interval for BFD packets.

❌ Missing from R2’s configuration (could be a cause for mismatch).

2. Analyzing the Configuration on R1 and R2

✅ Configuration on R1 (Correct)

shell

CopyEdit

bfd tor2 bind peer-ip 10.0.12.2

discriminator local 1

discriminator remote 2

min-tx-interval 1500

min-rx-interval 1500

This configuration is correct.

❌ Configuration on R2 (Incomplete)

shell

CopyEdit

bfd tor1 bind peer-ip 10.0.12.1

discriminator local 2

discriminator remote 1

Missing min-tx-interval and min-rx-interval.

3. Why the Answer is FALSE?

A BFD session does NOT go down due to mismatched timing parameters.

BFD dynamically negotiates timing values, meaning even if R2 is missing min-tx/min-rx values, the session should still establish.

However, the session will fail if the peer IP or discriminator values are incorrect (which they are NOT in this case).

The actual cause of failure in this case is likely the missing min-tx and min-rx settings on R2, NOT a mismatch between R1 and R2.

Comprehensive and Detailed In-Depth Explanation:

Step 1: Analyzing the Primary Path

The given network uses IS-IS Auto FRR, which ensures a backup route in case of failure.

The shortest path from R1 to 10.0.3.3/32 is calculated based on the OSPF link costs:

Path 1 (Primary Path): R1 → R2 → R3

Cost: 10 (R1→R2) + 5 (R2→R3) = 15 ✅

Step 2: Checking the Backup Path

The statement claims that the backup path is R1 → R4 → R2 → R3. Let's calculate the cost:

Path 2 (Backup Path via R4): R1 → R4 → R2 → R3

Cost: 10 (R1→R4) + 50 (R4→R2) + 5 (R2→R3) = 65 ❌ (Too high)

The backup path should be an alternative shortest path that is as close as possible to the primary path in cost.

R1 → R4 → R2 → R3 is not a feasible backup path because the cost (65) is significantly higher than the primary path (15).

Step 3: Correct Backup Path Selection

If IS-IS Auto FRR is enabled, a feasible backup path should have a cost close to the primary path.

In this scenario, no viable alternative path meets the Auto FRR requirements efficiently.

The given backup path is incorrect.

Final Answer: ✅ FALSE (Option B)

References:

HCIP-Datacom-Advanced Routing & Switching Technology V1.0 – IS-IS Auto FRR Mechanism

OSPF Route Selection and Fast Reroute Principles

OSPF and IS-IS Path Cost Calculation