Juniper JN0-364 Practice Exam Questions & Answers

The BGP path selection algorithm is a deterministic process used by Juniper routers to select the single 'best' path from the BGP table to be placed into the routing table (inet.0). This algorithm follows a specific, hierarchical set of rules. According to Juniper Networks technical documentation, the router evaluates attributes in a fixed order, and once a tie is broken at a specific step, the remaining steps are ignored.

The order of the primary BGP attributes in Junos OS is as follows:

Highest Local Preference: This is the first attribute evaluated after the basic check for a reachable next hop. Local preference is used within an Autonomous System (AS) to prioritize one exit point over another.

Shortest AS_PATH: If the local preference is equal, the router then evaluates the length of the AS_PATH attribute.

Lowest Origin Code: (IGP < EGP < Incomplete).

Lowest Multi-Exit Discriminator (MED).

In this specific scenario, the router compares a path with a higher local preference against a path with a shorter AS path. Because the Local Preference check occurs at Step 1 and the AS_PATH check occurs later at Step 2, the router will select the path with the higher local preference immediately. The length of the AS path becomes irrelevant in this comparison because the tie was already broken by the local preference value. This allows network administrators to override the default 'shortest path' logic of BGP to prefer specific providers or links based on business requirements.

For Juniper platforms equipped with dual Routing Engines (REs), the fundamental technology required to provide high availability during a hardware or software failure of the primary RE is Graceful Routing Engine Switchover (GRES).

According to Juniper Networks technical documentation, GRES allows the backup RE to stay in a 'hot' standby state. When GRES is enabled, the primary RE synchronizes critical state information with the backup RE, specifically the chassis state and the interface state. This synchronization includes the Packet Forwarding Engine (PFE) configuration.

When the primary RE fails, the backup RE takes over immediately. Because the PFE (which resides on the line cards) was already synchronized and is not restarted during the switchover, the router continues to forward packets that are already in flight or part of established flows. This prevents a complete network outage during an RE failover.

Comparison with other options:

NSB (Non-Stop Bridging - Option A): Focuses specifically on maintaining Layer 2 protocol states (like STP) during a switchover.

LAG (Link Aggregation - Option B): Provides redundancy for physical links, not the control plane or the RE.

BFD (Bidirectional Forwarding Detection - Option C): Is a protocol used for rapid detection of link or neighbor failures; it does not protect the RE or maintain forwarding during an internal switchover.

It is important to note that while GRES maintains the forwarding state, it does not by itself maintain the routing protocol state (adjacencies). To keep OSPF or BGP sessions from dropping during the switchover, GRES must be paired with Non-Stop Active Routing (NSR). However, as the question focuses on the core requirement of continuing to forward packets, GRES is the foundational technology.

In the Juniper Networks Junos operating system, aggregate routes are used to represent a group of more specific routes with a single, shorter prefix. This technique is essential for reducing the size of routing tables and minimizing the volume of routing updates sent to neighbors. According to Juniper technical documentation, for a destination IP address to 'match' a specific route, it must fall within the range defined by the network address and its associated CIDR mask.

The provided exhibit shows a detailed lookup for the aggregate route $10.16.2.0/23$. To determine the range of IP addresses covered by a $/23$ mask, we examine the binary representation of the third octet. A $/23$ mask means the first 23 bits are fixed. For the address $10.16.2.0$:

The first two octets ($10.16$) are fixed.

The third octet ($2$) is $00000010$ in binary.

The 23rd bit is the second-to-last bit of this octet.

The $/23$ range allows the 24th bit (the last bit of the third octet) and all 8 bits of the fourth octet to vary.

This results in a range where the third octet can be either $2$ ($00000010$) or $3$ ($00000011$). Therefore, the aggregate route $10.16.2.0/23$ covers all IP addresses from $10.16.2.0$ to $10.16.3.255$. The exhibit further confirms this by listing the 'Contributing Routes': $10.16.2.0/24$ and $10.16.3.0/24$.

Analyzing the provided options against this range:

10.16.3.79 (Option A): This address falls squarely within the $10.16.2.0$ to $10.16.3.255$ range.

10.16.0.4 (Option B): This address falls in the $10.16.0.0/23$ range ($0.0$ to $1.255$).

10.16.4.183 (Option C): This address falls in the $10.16.4.0/23$ range ($4.0$ to $5.255$).

10.16.1.214 (Option D): This address also falls in the $10.16.0.0/23$ range.

Consequently, 10.16.3.79 is the only destination listed that matches the aggregate route shown. It is also important to note the Next hop type: Reject in the exhibit; this means that if a packet matches the aggregate but does not match any of the more specific contributing routes, the router will drop the packet and send an ICMP unreachable message to the source.

The Hello packet is the most basic, yet most vital, component of the OSPF protocol. It serves as the primary mechanism for neighbor discovery, parameter negotiation, and 'keepalive' functionality. Per Juniper Networks' routing documentation, OSPF routers use the Hello protocol to dynamically discover other OSPF-enabled routers on their directly connected segments.

When OSPF is enabled on a Junos interface, the router begins multicasting Hello packets (typically to the 224.0.0.5 'All OSPF Routers' address). This initiates the neighbor relationship. For two routers to move beyond the Init state and become neighbors, they must agree on several critical parameters contained within the Hello packet:

Area ID: Routers must be in the same OSPF area.

Authentication: Passwords or keys must match.

Timers: The Hello and Dead intervals must be identical.

Options: Such as Stub area flags.

Beyond the initial 'initiation,' the Hello packet is used to maintain the relationship. By continuously sending these packets at a fixed interval (the Hello interval), a router signals to its peers that it is still functional. If a router stops receiving Hello packets from a neighbor for a duration exceeding the Dead Interval, it declares the neighbor 'down,' flushes the associated LSAs from the database, and triggers a new SPF calculation.

Furthermore, on multi-access networks like Ethernet, the Hello packet is the vehicle for the election of the Designated Router (DR) and Backup Designated Router (BDR). By exchanging priority values and Router IDs within the Hello packets, the segment can elect a central point of contact to minimize the number of adjacencies required on the wire.

In Junos OS, a static route is a manually configured entry in the routing table. Unlike dynamic routes, which have built-in timers and aging mechanisms, static routes are generally 'permanent' as long as their conditions for validity are met.

1. Manual Removal (Option A):

Since static routes are explicitly defined by the administrator, the most direct way to remove one is through a configuration change. Using the delete routing-options static route command followed by a commit will immediately remove the route from the Routing Information Base (RIB).

2. Next-Hop Reachability (Option B):

For a static route to be 'active' and installed in the forwarding table, its next-hop must be reachable. If a static route points to a specific physical interface or an IP address on a local segment, and that outbound interface becomes unavailable (e.g., the link goes 'Down'), the Junos kernel detects that the next-hop is no longer viable. Consequently, the route is marked as 'hidden' or 'inactive' and is removed from the active forwarding table to prevent traffic from being black-holed.

Why other options are incorrect:

Aging (Option C): Static routes do not have an expiration timer based on traffic. Even if no packet is sent for years, the route remains as long as the interface is up.

Remote Reachability (Option D): Standard static routes only track the status of the local interface or the immediate next-hop. They do not possess 'end-to-end' visibility. If a host two hops away fails, the local router has no way of knowing this via the static route itself. To achieve this level of tracking, features like RPM (Real-time Performance Monitoring) or BFD (Bidirectional Forwarding Detection) must be linked to the static route.