Free Huawei H12-821_V1.0 Practice Exam with Questions & Answers

When a stack splits, the MAC addresses of the newly formed stacks do not change immediately. Instead, they retain their original MAC addresses until new ones are reassigned during topology updates. This delayed update prevents immediate conflicts and allows MAD (Multiple Active Detection) to handle any resulting issues ​.

Comprehensive and Detailed In-Depth Explanation:

A. TRUE → Firewalls maintain session tables with a default session timeout ; adjusting it depends on network conditions .

B. FALSE → Fast session aging does not affect persistent connection sessions . Persistent connections (e.g., TCP keepalives) maintain sessions even if aging settings change.

C. TRUE → Sessions must be constantly matched with ongoing traffic to remain active .

D. TRUE → Even without stateful inspection , the firewall creates session entries for non-first packets to maintain continuity of services .

???? Reference: Huawei HCIA-Datacom Study Guide, Firewall Session Table Mechanism.

When the router ID is configured in both the system view and the BGP view, the router ID in the BGP view takes precedence because BGP-specific configurations override global settings. This ensures that BGP operates with the most relevant configurations ​.

VRRP defines the following states:

Initialize – The router is starting up or has not joined a VRRP group.

Backup – The router is in standby and monitors the Master.

Master – The only state where the device forwards traffic for the virtual IP address .

Only the router in the Master state owns the virtual MAC and responds to ARP for the virtual IP.

Reference from Huawei HCIP-Datacom-Core Technology Study Guide:

“In VRRP, only the Master forwards packets destined for the virtual IP address. Backup routers take over only if the Master fails.”

(Chapter: VRRP Concepts – Section: State Roles and Transitions)

Comprehensive and Detailed Step-by-Step Explanation:

1. BGP Attributes Overview:

BGP uses attributes to describe the properties of routes. These attributes are classified into the following categories:

Well-Known Mandatory : Attributes that must be recognized and included in every BGP update. Examples: AS_PATH, ORIGIN, NEXT_HOP.

Well-Known Discretionary : Attributes that must be recognized but are not required in every BGP update. Examples: LOCAL_PREF, ATOMIC_AGGREGATE.

Optional Transitive : Attributes that may or may not be recognized, but must be passed along to other BGP peers. Examples: COMMUNITY.

Optional Non-Transitive : Attributes that may or may not be recognized, and are not passed along to other BGP peers. Examples: MED (Multi-Exit Discriminator).

2. Analysis of Each Option:

Option A: Atomic_Aggregate

Correct .

This is a well-known discretionary attribute. It indicates that the advertised route is an aggregate route that summarizes multiple specific routes.

Option B: Local-Preference

Correct .

This is a well-known discretionary attribute. It is used within an AS to prioritize routes, with higher values being preferred.

Option C: Community

Incorrect .

The COMMUNITY attribute is an optional transitive attribute. It is used to tag routes with specific labels to apply routing policies.

Option D: MED (Multi-Exit Discriminator)

Incorrect .

The MED attribute is an optional non-transitive attribute. It is used to influence the choice of the preferred path when there are multiple entry points into an AS.

3. Summary:

Well-Known Discretionary Attributes : Atomic_Aggregate and Local-Preference.

Comprehensive and Detailed In-Depth Explanation:

In IS-IS , routes are distributed differently based on router levels :

Level-1 (L1) routers → Maintain specific routes only within their own area .

Level-2 (L2) routers → Maintain specific routes for the entire network (inter-area routing).

Level-1-2 (L1/L2) routers → Store both L1 and L2 routes and act as area border routers .

In the diagram, R2 and R3 are L1/L2 routers , meaning they store specific routes for both their area and other areas .

R1 is only an L1 router , meaning it only has intra-area routes , and R7 is an L2-only router , meaning it does not store all specific routes.

Therefore, R2 and R3 have specific routes for the entire network.

???? Reference: Huawei HCIA-Datacom Study Guide, IS-IS Routing Levels and Route Distribution.

In IPv6 , fragmentation is handled only at the source node . Intermediate routers do not fragment packets . Instead, if a packet is too large for the next link, the router sends back an ICMPv6 Packet Too Big message to the source, which then adjusts its packet size.

This design:

Reduces processing load on intermediate devices.

Supports Path MTU Discovery (PMTUD).

Reference from Huawei HCIP-Datacom-Core Technology Study Guide:

“In IPv6, routers do not perform fragmentation. Only the source device fragments packets if needed, based on ICMPv6 feedback.”

(Chapter: IPv6 Fundamentals – Section: Fragmentation and PMTUD)

Comprehensive and Detailed In-Depth Explanation:

Type 1 LSAs (Router LSAs) are generated by every OSPF router to describe its directly connected links and their states.

The Router ID (RID) must be unique in an OSPF domain; otherwise, OSPF calculations will fail due to ambiguous paths .

If two routers in the same area have the same Router ID , OSPF will fail to calculate Shortest Path First (SPF) correctly, leading to routing inconsistencies.

To prevent this, Huawei routers automatically detect duplicate Router IDs and prevent OSPF from functioning properly until the issue is resolved.

???? Reference: Huawei HCIA-Datacom Study Guide, Chapter on OSPF LSAs and Router ID Uniqueness.

Comprehensive and Detailed Step-by-Step Explanation:

Distance-Vector Protocols:

Distance-vector protocols determine the best path based on the distance to a destination and periodically share the entire routing table with neighbors.

Example: RIP is a distance-vector protocol.

Link-State Protocols:

Link-state protocols share information about directly connected links, enabling routers to build a complete map of the network.

OSPF (Open Shortest Path First) and IS-IS (Intermediate System to Intermediate System) are link-state protocols that use Dijkstra’s algorithm to calculate the shortest path.

Border Gateway Protocol (BGP):

BGP is neither a distance-vector nor a link-state protocol. Instead, it is classified as a path-vector protocol that selects the best path based on attributes such as AS-path, next-hop, and local preference.