JN0-352 Enterprise Routing and Switching, Specialist (JNCIS-ENT) Question and Answers

On EX Series switches, aggregated Ethernet (ae) interfaces do not exist by default; before any ae interface can be created, referenced, or brought into service, an administrator must first reserve the desired number of aggregated Ethernet device slots by configuring set chassis aggregated-devices ethernet device-count number at the [edit chassis] hierarchy. This statement allocates the internal resources needed for that many ae interfaces to exist as valid, configurable objects; until it is committed, any interface-level configuration referencing ae0 (such as the aggregated-ether-options and family ethernet-switching stanzas shown in the exhibit) is accepted syntactically by the CLI but never actually instantiates a live ae0 device, which is exactly why show interfaces ae0.0 returns 'device ae0 not found' despite the interface appearing fully configured. Increasing the device-count to at least 1 (or higher, to cover the number of LAG bundles planned) immediately resolves this and allows ae0 to appear as an operational interface once its member links are also associated with it. This is a foundational and frequently overlooked prerequisite step in LAG deployment on Juniper switches. There is no separate licensing requirement for aggregated Ethernet functionality on EX Series switches, a reboot is not needed since the chassis statement takes effect upon commit, and the LACP mode (active versus passive) is unrelated to whether the ae interface object itself exists in the first place. Reference topics: Junos Enterprise Switching – Link Aggregation, Configuring the Aggregated Ethernet Device Count.

The described symptom — excessive packet drops specifically attributed to exceeding the MTU on a GRE tunnel carrying full-size video streaming traffic across default-MTU gigabit Ethernet interfaces — is a direct consequence of the 24 bytes of GRE encapsulation overhead pushing packets that were already at or near the standard 1500-byte Ethernet MTU past the physical interface's transmission limit once the outer GRE and IP headers are added. The most durable fix is to proactively increase the physical member interfaces' MTU beyond the 1500-byte default — to 1524 bytes or higher — which provides sufficient headroom to absorb the full GRE encapsulation overhead without ever causing the fully encapsulated packet to exceed the interface's transmission capability, allowing full-size 1500-byte payloads to pass through the tunnel intact and without fragmentation or drops. As a complementary measure, configuring the clear-dont-fragment-bit option on the tunnel or member interfaces instructs Junos to clear the DF (don't fragment) bit on oversized packets rather than dropping them outright when they do exceed the available MTU, allowing the Packet Forwarding Engine to fragment and later reassemble the traffic instead of silently discarding it, which directly addresses the reported packet loss even under transient conditions. Simply raising the MTU only to 1500 bytes fails to account for the 24-byte GRE overhead and would not resolve the underlying oversize condition. Routing the tunnel over a higher-bandwidth link addresses potential congestion but does nothing to correct an MTU-based packet-size violation, which is the root cause explicitly identified in this scenario. Reference topics: Junos Enterprise Routing – Tunneling, GRE MTU Sizing and Fragmentation Handling for High-Throughput Applications.

A generate route is a specialized type of Junos summary route that, unlike an aggregate route, is permitted to inherit and use an actual forwarding next hop rather than being restricted to reject or discard. When multiple contributing routes exist beneath the summarized prefix, Junos selects one of them as the primary contributor using a deterministic process: it first evaluates route preference (choosing the contributor with the lowest, most preferred value), then breaks any remaining tie by preferring the contributing route with the numerically lowest metric, and continues through further tie-breaking criteria if necessary until a single primary contributor is identified. The generate route then adopts the next hop of that specific primary contributor as its own forwarding next hop, meaning traffic matching the generate route but not matching any individual contributing route is forwarded toward whichever real next hop the primary (best) contributing route currently uses. This behavior is fundamentally different from an aggregate route, which never adopts a forwarding next hop at all and instead installs with a reject (or optionally discard) next hop by default, deliberately preventing traffic from being forwarded toward a next hop that might not actually lead to the intended more-specific destination. There is no mechanism by which the next hop is chosen arbitrarily from the 'first' or 'least-specific' contributor, and while a next hop can be manually overridden under the generate route's own configuration, that is not the default resolution behavior being described here. Reference topics: Junos Enterprise Routing – Protocol Independent Routing, Generate Routes and Primary Contributor Selection.

A GRE-encapsulated packet consists of the original passenger packet wrapped inside a GRE header and a new outer IP delivery header, and the combined size of these two additions is what constitutes GRE's per-packet overhead. The base GRE header, as defined in RFC 2784 and used in its minimal, non-keyed, non-checksummed form (the default and most common deployment), is exactly 4 bytes in length, containing the flags/version field and the protocol type field identifying the encapsulated payload's ether type. Layered around that GRE header is a completely new outer IPv4 header, which itself consumes a standard 20 bytes, containing the tunnel source and destination addresses used for delivery across the underlying network. Adding these two components together — 4 bytes for the GRE header plus 20 bytes for the new outer IPv4 header — yields a total of exactly 24 bytes of overhead imposed on every encapsulated packet, which is precisely why Junos automatically sets the default protocol MTU on gr- tunnel interfaces to 1476 bytes (1500 minus 24) to prevent oversized, post-encapsulation packets from requiring fragmentation on a standard 1500-byte Ethernet path. The 20-byte figure alone describes only the new IP header in isolation and omits the GRE header itself, while 12 and 32 bytes do not correspond to any standard, non-keyed GRE encapsulation configuration and are included purely as plausible-looking distractors. Reference topics: Junos Enterprise Routing – Tunneling, GRE Header Overhead and MTU Planning.

VLAN 5 and VLAN 7 are two entirely separate Layer 2 broadcast domains, each with its own distinct IP subnet, and devices in one VLAN can never reach devices in the other through switching alone — Layer 3 routing between the two subnets is mandatory for any inter-VLAN communication to occur, regardless of how the VLANs are configured at Layer 2. On a single EX Series switch, the correct and standard mechanism for enabling this routing without an external router is to create one integrated routing and bridging (IRB) logical interface for each VLAN, assign each IRB the appropriate gateway IP address for its respective subnet (192.168.5.1 for VLAN 5's irb.5 and 192.168.7.1 for VLAN 7's irb.7, for example), and ensure routing is active on the switch so that traffic arriving at one IRB's gateway address destined for the other VLAN's subnet is routed internally between the two IRB interfaces. Attempting to bind a single family inet interface with two distinct subnet addresses via secondary addressing conflates two separate broadcast domains onto one Layer 3 interface incorrectly and is not how VLAN routing is architected in Junos. Spanning tree exists purely to prevent Layer 2 loops and has no routing function whatsoever, so configuring it cannot enable inter-VLAN reachability. Placing both VLANs on a single trunk with Multiple VLAN Registration Protocol (MVRP) only automates VLAN membership propagation across trunk links; it does not provide any Layer 3 routing capability between the VLANs either. Reference topics: Junos Enterprise Switching – Routing VLANs, Configuring IRB Interfaces for Inter-VLAN Routing.

GRE is fundamentally a stateless encapsulation protocol: the encapsulating router simply wraps the passenger packet in a GRE header and an outer delivery IP header and forwards it based on ordinary IP routing table lookups toward the configured tunnel destination address. For that forwarding to succeed, the underlying (global or routing-instance) routing table on each endpoint must contain a valid, reachable route to the far-end tunnel address; without such a route, the tunnel interface will not come up or will be unable to deliver traffic, since GRE relies entirely on the existing IP infrastructure rather than any tunnel-specific signaling to establish reachability. Because GRE has no built-in state machine or session negotiation, it does not natively track whether the remote endpoint is alive — that requires an optional add-on such as GRE keepalives or BFD, neither of which is enabled by default; an operator must explicitly configure them if failure detection is required. GRE is also protocol-agnostic rather than IPv4-only: it can encapsulate IPv4, IPv6, MPLS, and other network-layer protocols as the passenger, which is one of its defining advantages over IP-in-IP tunneling. Finally, because GRE keeps no per-session state about the peer, it cannot detect or report tunnel failures on its own, reinforcing why route reachability is the one true prerequisite for tunnel operation. Reference topics: Junos Enterprise Routing – Tunneling, Understanding Generic Routing Encapsulation.

BGP employs two distinct loop-prevention mechanisms depending on whether peers are external or internal to the same autonomous system. Between external peers (EBGP), loop prevention relies on the AS path attribute: every time a route crosses an AS boundary, the local AS number is prepended to the path, and a router rejects any incoming route whose AS path already contains its own AS number, since that would indicate the route has looped back around. Between internal peers (IBGP) within the same AS, however, the AS path attribute never changes, because IBGP does not add AS numbers as routes are readvertised internally — meaning AS path alone cannot detect an internal loop. Instead, IBGP enforces a strict split-horizon-style rule: a router that learns a route via IBGP must never readvertise that route to another IBGP peer. This rule guarantees that every IBGP speaker within the AS must be directly peered with every other IBGP speaker (a logical full mesh) in order for all routers to receive all routes, since no IBGP router will relay IBGP-learned routes onward on another router's behalf. This full-mesh requirement is precisely why techniques such as route reflection and confederations were later developed — they preserve the same loop-prevention guarantee while relaxing the physical full-mesh peering burden. VRRP and BFD serve entirely unrelated purposes (gateway redundancy and fast failure detection, respectively) and play no role in BGP loop prevention. Reference topics: Junos Enterprise Routing – BGP, IBGP Split-Horizon and the Full-Mesh Requirement.

OSPF neighbor state progression, as defined in RFC 2328 and displayed by Junos through show ospf neighbor, moves through a well-defined set of named states: Down, Attempt, Init, 2-Way, ExStart, Exchange, Loading, and Full. Down is the initial state, indicating no Hello packets have been recently received from a potential neighbor on that interface; it is a genuine, valid OSPF state and is correctly included here. Init indicates that a Hello packet has been received from the neighbor, but that neighbor has not yet listed the local router's own router ID within its Hello packet, so bidirectional communication has not yet been confirmed; this too is a standard, valid state. Loading occurs after the Exchange state, during which Database Description packets have been fully exchanged and the router is now actively requesting the specific, more-detailed LSAs it identified as missing or outdated from its neighbor via Link State Request packets; it is likewise a standard, valid OSPF neighbor state. 'Established' is not an OSPF state at all — that terminology belongs to BGP's finite state machine, where Established represents the fully operational session state; the OSPF equivalent concept is instead called Full. 'Reject' is not a recognized OSPF neighbor state under any circumstance and does not appear anywhere in the RFC 2328 state machine, making it an invalid distractor as well. Reference topics: Junos Enterprise Routing – OSPF, The OSPF Neighbor State Machine.

The Junos BGP path selection algorithm proceeds through a strict, ordered sequence of comparison steps, and once next-hop reachability and route preference (administrative distance) have been confirmed as equal, local preference is the very first BGP-specific path attribute evaluated in the decision process. A route carrying a higher local preference value is always chosen over a competing route to the same prefix with a lower local preference, and this comparison takes absolute precedence over every subsequent attribute in the algorithm; if local preference values differ between candidate paths, the selection process concludes at this step without ever needing to examine AS path length, origin type, or MED at all. Only when two or more competing paths share an identical local preference value does the algorithm proceed to its third step, comparing AS path length and preferring the shortest, and only after a further tie does it move on to origin type (preferring IGP-origin over EGP-origin, and EGP-origin over incomplete), followed by MED comparison (preferring the lowest value, and only among routes learned from the same neighboring AS by default). Because local preference is evaluated strictly before all three of the other listed attributes, it is the attribute BGP consults first among the choices given, making it the deciding factor in scenarios such as this exhibit where multiple autonomous systems advertise competing paths toward the same 192.168.1.0/24 prefix. Reference topics: Junos Enterprise Routing – BGP, Understanding BGP Path Selection Order.

TLV 22, the Extended IS Reachability TLV defined in RFC 5305, is the modern and Junos-preferred mechanism for advertising a router's adjacent neighbors together with the metric associated with each link. It carries the seven-octet system ID and pseudonode number of each neighbor along with a 24-bit wide metric field, and supports an extensible set of sub-TLVs used for traffic-engineering data such as interface and neighbor IP addresses, bandwidth, and administrative groups. The original IS Reachability TLV, TLV 2, defined in the base ISO 10589 standard, carries similar neighbor and metric information but is constrained to a 6-bit narrow metric with a maximum value of 63, which is inadequate for expressing meaningful cost differentiation in modern, high-capacity enterprise and service-provider topologies; consequently, Junos deployments are commonly configured for wide-metrics-only, favoring TLV 22 over the legacy TLV 2 whenever traffic-engineering-capable or simply more granular metric representation is desired. TLV 132, the IP Interface Address TLV, only advertises the IPv4 addresses configured on the originating router's interfaces and carries no neighbor-adjacency or metric information. TLV 129, the Protocols Supported TLV, merely lists which network-layer protocols (such as IPv4 or IPv6) the originating router is capable of routing, and likewise has nothing to do with neighbor reachability or link cost. Reference topics: Junos Enterprise Routing – IS-IS, Extended IS Reachability and Wide Metrics.

Switch A is already fixed as the root bridge in this topology (priority 0), so the outcome being engineered here is not about root bridge election at all, but about which of Switch C's two available paths toward that already-established root — the direct C-to-A link, or the indirect C-to-B-to-A path — RSTP selects as the lower-cost, primary path. RSTP's path-cost calculation for any non-root switch sums the port costs of every link along a candidate path to the root and always selects whichever candidate path has the lowest total accumulated cost as that switch's active root path, placing the corresponding local port into the forwarding root port role while any higher-cost alternative path is placed into a non-forwarding (alternate) role. To force Switch C to prefer routing through Switch B rather than connecting to Switch A directly, the administrator must make the direct C-to-A link's cost higher than the combined cost of the C-to-B link plus the B-to-A link added together, so that the indirect, two-hop path through Switch B mathematically totals to a lower cumulative cost than the single direct hop, causing RSTP's cost comparison to favor the indirect path as primary. Setting Switch B's priority (to either 1 or 0) is irrelevant here, since Switch B is not a root bridge candidate in this scenario and priority manipulation would only affect a root bridge election, not path cost preference between a fixed root and a downstream switch. Lowering the direct link's cost, the inverse of the correct answer, would instead reinforce the direct path rather than override it. Reference topics: Junos Enterprise Switching – Spanning Tree Protocols, RSTP Path Cost and Root Port Selection.

The L column in this output identifies which IS-IS levels are active on each interface, using the standard bitmask where 1 represents Level 1 only and 3 represents both Level 1 and Level 2 combined. Interface ge-0/0/2.0 shows an L value of 1 and its Level 2 DR field explicitly reads Disabled, meaning Level 2 has not been enabled on that circuit at all; consequently no Level 2 adjacency can ever form there, regardless of what the neighboring router advertises, which confirms that statement as correct. The lo0.0 loopback interface shows Passive under both the Level 1 DR and Level 2 DR columns. A passive IS-IS interface is deliberately excluded from adjacency formation — no IIH PDUs are sent or expected on it — but its associated prefix is still injected into the router's own LSP and flooded throughout the area, which is precisely why loopbacks are configured as passive: to guarantee the router ID/loopback prefix is reachable network-wide without wasting adjacency overhead on an interface with no real neighbor. This confirms that R3 advertises its loopback address, while ruling out the claim that the loopback is used to form an adjacency. Regarding designated routers, all circuits shown here report 'Point to Point' rather than an actual DR system ID, because DR election in IS-IS is a construct exclusive to broadcast (LAN) circuits; point-to-point circuits never elect a DR, so the first statement is false. Reference topics: Junos Enterprise Routing – IS-IS, Interface Levels and Passive Interfaces.

Junos firewall filters evaluate terms sequentially from top to bottom, and a term is only terminal for a packet if its then clause contains an explicit terminating action such as accept, discard, reject, or next term without a match. The count and log actions used in track-icmp are non-terminating; they update statistics and generate a log entry but do not stop evaluation, so a matching ICMP packet falls through to the next term after being counted. The second term, allow-tcp-established, matches only TCP packets carrying the ACK or RST flags as defined by the tcp-established keyword; an ICMP echo request does not satisfy protocol tcp, so this term is skipped entirely and does not accept the packet. Evaluation therefore reaches the implicit catch-all term block-rest, which has no from conditions and matches every remaining packet, incrementing blocked-counter and discarding it. The net effect for the described ICMP ping is that icmp-counter is incremented by the first term, the packet is neither accepted nor rejected by the second term, and blocked-counter is incremented immediately before the packet is silently discarded by the final term. This layered-term behavior, where counting is independent of the accept/discard decision, is a frequently tested nuance of Junos firewall filter processing logic. Reference topics: Junos Enterprise Switching – Layer 2 Security and Firewall Filters, Filter Term Evaluation Order.

Root bridge election in Spanning Tree Protocol is governed entirely by the Bridge Identifier, an 8-byte value formed by concatenating the configured bridge priority (the higher-order, more significant portion of the comparison) with the switch's MAC address (used strictly as a tiebreaker when priorities are identical). Every participating switch compares Bridge IDs, and the switch advertising the numerically lowest Bridge ID is elected root. In this exhibit, the three switches have distinctly different priority values — EX-1 at the Junos/IEEE default of 32768, EX-2 at 8192, and EX-3 at 16384 — meaning the comparison is decided entirely at the priority stage and never needs to proceed to a MAC address tiebreak at all. Since 8192 is numerically the lowest of the three priority values, EX-2 is elected root bridge purely on the strength of its lower priority, regardless of what its MAC address happens to be. This is precisely why the correct answer cites priority rather than MAC address as the deciding factor: MAC address only becomes relevant as a tiebreaker in the specific case where two or more switches share an identical priority value, which is not the situation presented here. Understanding that priority is evaluated first and is independently sufficient to decide the outcome whenever it differs is a foundational and heavily tested Spanning Tree concept on the JNCIS-ENT exam. Reference topics: Junos Enterprise Switching – Spanning Tree Protocols, Bridge ID and Root Bridge Election.

The show ethernet-switching table command displays the Layer 2 forwarding database (the bridge or MAC table) that an EX Series switch builds dynamically by inspecting the source MAC address of every frame it receives. Each entry records the learned MAC address, the VLAN it was learned on, the type of entry (dynamic, static, or persistent), and the specific interface through which that address was seen, which is precisely the information needed to confirm whether the switch has learned the host connected to ge-0/0/3. If the host's MAC address is absent from the table, that immediately points to a Layer 1/2 issue — no frames have been received from the host, a cabling or port problem exists, or the interface is administratively down or blocked by spanning tree — rather than a Layer 3 routing or VLAN membership problem. show interfaces terse only reports administrative and link state along with any assigned protocol family addresses, offering no MAC-learning visibility. show vlans lists VLAN definitions and their member interfaces but does not display learned host addresses. show interfaces extensive provides detailed physical-layer counters and error statistics, useful for diagnosing frame loss or interface errors, but it does not expose the switching table. For intra-VLAN reachability troubleshooting, verifying MAC learning is always the first and most direct Layer 2 checkpoint. Reference topics: Junos Enterprise Switching – Layer 2 Switching Fundamentals, Monitoring the Ethernet Switching Table.

RFC 4271 defines the BGP finite state machine as a strict, ordered progression of six states that a session must move through to successfully establish. A newly configured or reset session always begins in Idle, where BGP initializes resources and refuses connections until the ConnectRetry timer fires. From Idle, the router transitions to Connect and attempts to establish the underlying TCP transport session to the configured peer address on port 179. If that TCP attempt does not immediately succeed, the session falls back to the Active state, where the router continues retrying the TCP connection in the background; once the TCP handshake finally completes (from either Connect or Active), the session advances to OpenSent, during which the router transmits its own BGP OPEN message advertising its AS number, hold time, BGP identifier, and capabilities. Upon receiving and validating a compatible OPEN message from the peer, the session moves to OpenConfirm, where both sides exchange KEEPALIVE messages to confirm the parameters negotiated in the OPEN exchange are mutually acceptable. Only after this confirmation does the session reach Established, the final state in which UPDATE messages carrying actual routing information begin to flow between the peers. Any deviation from this Idle → Connect → Active → OpenSent → OpenConfirm → Established ordering, as presented in the other answer choices, does not reflect the standardized BGP state machine. Reference topics: Junos Enterprise Routing – BGP, The BGP Finite State Machine.