Juniper JN0-281 Exam Dumps

Nonstop bridging is a high availability capability focused on maintaining Layer 2 switching continuity during a Routing Engine switchover on platforms that support redundant control planes. The intent is to keep Layer 2 forwarding operational and minimize disruption to bridged traffic when the system transitions from a primary to a backup Routing Engine. Achieving this requires Graceful Routing Engine switchover, because GRES is the mechanism that enables a control plane switchover while keeping forwarding and interface state stable. With GRES in place, the forwarding plane can continue switching frames while the backup Routing Engine assumes control, reducing or eliminating traffic loss for Layer 2 domains.

Nonstop bridging is not the feature that preserves Layer 3 protocol sessions and routing information end-to-end. That function is associated with nonstop routing capabilities, which focus on maintaining routing protocol state across Routing Engine events. Therefore, stating that nonstop bridging preserves Layer 3 information and protocol sessions is incorrect. Likewise, nonstop active routing is not a requirement for nonstop bridging; it is a separate feature aimed at routing stability. The flow-control setting under gigether-options is unrelated to Routing Engine redundancy and does not determine whether nonstop bridging operates.

In data center access and aggregation environments where VLANs must remain stable for servers and appliances, nonstop bridging paired with GRES helps protect Layer 2 service continuity during control plane events.

In Junos BGP configuration, export policy can be applied at multiple levels, including the BGP group level and the individual neighbor level. When an export policy is configured directly under a specific neighbor, that policy is explicitly associated with advertisements sent to that neighbor and is therefore the policy that applies to that neighbor. In the exhibit, neighbor 172.16.1.101 has an export statement configured within the neighbor stanza, and that statement references the advertise-ospf policy. This is the most specific policy attachment in the configuration because it is tied to a single peer rather than to the entire group or the whole BGP process.

Group-level export policies, such as advertise-aggregate configured under the group, apply broadly to all neighbors in that group unless a neighbor has additional neighbor-specific policy. A BGP-level export policy configured outside the group applies as a more general export policy scope. However, the question asks which export policy applies to the specific neighbor, and the correct selection is the neighbor-specific export policy that is explicitly configured for that peer.

Operationally, this allows data center engineers to advertise different route sets to different peers, for example exporting OSPF-derived infrastructure routes to one neighbor while exporting aggregates or static routes to another, all while keeping a consistent group template for shared settings such as peer AS and session type.

The configuration defines a static route for 192.168.1.0/24 with a primary next hop of 10.20.20.254 and a qualified-next-hop of 10.20.20.253 with preference 25. In Junos, qualified next hop is used to create preference-ranked redundancy for a static route, typically primary and backup forwarding. The key behavior is that the best, lowest preference path is selected as active. For static routes, the default preference for the route and its primary next hop is lower than 25 unless you explicitly raise it. Because the qualified-next-hop is configured with preference 25, it is less preferred than the primary next hop, so 10.20.20.254 remains the selected next hop during normal operation.

This is not load balancing. Junos does not automatically install both next hops for forwarding simply because more than one next hop is configured when one is qualified with a higher preference. Instead, the qualified next hop is held in reserve and is used only when the primary next hop becomes unusable, such as when it is no longer resolvable or the associated forwarding condition fails. Therefore, the route is expected to be installed and active using 10.20.20.254 under normal conditions, with 10.20.20.253 acting as a backup path.

EBGP is defined as BGP peering between different autonomous systems, which makes statement A correct. In data center IP fabrics, it is common to assign different private AS numbers to leaves and spines or to use a structured AS design so that every leaf forms EBGP sessions to each spine. This provides clear policy boundaries, straightforward troubleshooting, and predictable route propagation without needing an additional interior gateway protocol to carry underlay reachability.

Statement C is also correct because EBGP can be deployed without a supporting IGP. BGP itself can distribute the underlay routes needed for fabric reachability, such as loopback addresses and point to point link prefixes. This is a widely used approach for leaf spine fabrics because it reduces protocol complexity and avoids running multiple control planes for the underlay. Convergence can be improved using multipath, rapid failure detection mechanisms, and consistent routing policy.

Statement B is incorrect because BGP within a single AS is IBGP, not EBGP. Statement D is incorrect because while some designs may choose to run an IGP and use BGP only for certain functions, EBGP does not inherently require an IGP to operate or to provide underlay connectivity in a fabric design.

Traditional data center networks are often built using a layered three-tier design with access, aggregation, and core. These designs frequently rely on Layer 2 domains and spanning tree to prevent loops. One major drawback is inefficient resource usage. Spanning tree typically blocks redundant links, which means installed bandwidth and expensive uplinks can sit idle during normal operation. To compensate, organizations overbuild capacity or use complex workarounds, raising cost and operational burden. In addition, scaling tends to be vertical, adding bigger chassis or more complex aggregation, which can concentrate risk and reduce flexibility.

Another common challenge is increased latency. In a three-tier model, traffic between servers in different access blocks often traverses multiple tiers, adding hops and delay. Even when traffic stays within the same facility, the path is not consistently short, and application performance can suffer, especially for east-west workloads such as distributed databases and microservices where frequent server-to-server communication is normal. Modern leaf spine IP fabrics reduce these issues by using a routed underlay with predictable one-spine-hop paths between leaves and by keeping all links active with multipath routing.

While traditional architectures can also experience suboptimal path behavior, the most consistently cited challenges are idle capacity due to blocked links and additional hop count that increases latency.