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

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.

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.

The entire purpose of route aggregation is summarization — replacing a set of more-specific contributing routes with a single, broader prefix advertised outward — and this summarization inherently hides internal routing instability from external peers: if one of the underlying contributing /24 blocks within a summarized /16 flaps up and down due to a local link issue, external peers who only see the stable, unchanging /16 aggregate are completely insulated from that churn, since the aggregate itself remains active and advertised as long as at least one contributing route is present, regardless of how much internal fluctuation occurs among the individual contributors. This stability-hiding characteristic is one of the primary operational benefits that motivates using aggregate routes in the first place, confirming that statement as correct. Regarding next-hop behavior, official Juniper documentation is explicit and unambiguous: when an aggregate route is installed in the routing table, Junos assigns it a reject next hop by default, meaning traffic matching only the aggregate (and no more-specific contributor) is dropped and an ICMP unreachable message is returned to the source; a discard next hop is available only as an optional, explicitly configured alternative when silent dropping without ICMP notification is preferred, but it is not the default. Aggregate routes categorically do not advertise their individual contributing routes; suppressing those specific, more-granular prefixes from onward advertisement in favor of the single summary is the aggregate's defining function, directly contradicting the first statement. Reference topics: Junos Enterprise Routing – Protocol Independent Routing, Default Reject Next Hop and Route Summarization Benefits.

The show route advertising-protocol bgp command displays exactly what would be transmitted to a specific BGP neighbor after all configured export routing policy has already been evaluated and applied, meaning any prefixes shown in this output have successfully passed through the export policy chain — confirming the export routing policy has been processed. The command header explicitly states '7 destinations, 7 routes (7 active, ...)' and every listed prefix is preceded by an asterisk, Junos's standard marker for an active route, confirming all seven displayed routes are active in the local routing table. The routing table name shown, XYZ.inet.0, indicates these routes reside in a named routing instance called XYZ rather than the default master routing instance, whose table would instead be labeled simply inet.0; this rules out the statement claiming the routes belong to the default instance. The AS path column shows only the origin code 'I' (IGP) with no AS numbers prepended ahead of it, meaning the AS path is empty, which indicates these prefixes were originated locally within R1's own AS (through redistribution or local origination) rather than having been learned from and passed through an external AS, ruling out that statement as well. Finally, the Nexthop column explicitly shows 'Self' for every route rather than an actual peer or learned address, confirming R1 is rewriting the next-hop attribute to its own address before advertising — a deliberate next-hop-self policy action typically applied toward IBGP peers. Reference topics: Junos Enterprise Routing – BGP, Verifying Advertised Routes and Export Policy Effects.

The 10.20.0.0/22 aggregate covers the four /24 blocks 10.20.0.0/24 through 10.20.3.0/24, but only the first three of those (10.20.0.0/24, 10.20.1.0/24, and 10.20.2.0/24) are configured and present as active contributing routes; 10.20.3.0/24, the block containing the destination address 10.20.3.100, has no corresponding contributing route in this configuration. Because no more-specific route exists for 10.20.3.100, the longest-match lookup falls through the missing /24 and matches only the broader /22 aggregate itself. By default, when Junos installs an aggregate route, it assigns that route a reject next hop rather than any usable forwarding next hop; this is a deliberate design choice so that traffic destined for gaps within an advertised summary block — gaps where no real, more-specific path actually exists — is not blindly forwarded toward whatever next hop happens to belong to one of the unrelated contributing routes. A reject next hop causes the router to drop the packet and generate and return an ICMP destination-unreachable message to the originating source, explicitly informing it that no path exists, which is functionally and behaviorally distinct from a silent discard next hop that would drop the packet without any such notification. Aggregate routes never adopt or forward through any single contributing route's next hop, which rules out the two forwarding-based answer choices entirely. Reference topics: Junos Enterprise Routing – Protocol Independent Routing, Default Reject Next Hop for Aggregate Routes.

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.

RFC 2328 specifies a precise set of parameters that two OSPF routers on a broadcast network must agree upon before a valid neighbor relationship can be established, and a mismatch in any of these mandatory fields causes the routers to reject each other's Hello packets outright rather than forming even a basic 2-Way state. The network mask carried in each Hello packet must match between neighbors on a broadcast segment, since OSPF uses this field to confirm both routers agree on the subnet boundaries of the shared segment; a mismatched mask (for example, one router configured with a /24 and its neighbor with a /25 on the same physical wire) is treated as a configuration error and blocks adjacency formation. The router dead interval, which defines how long a router will wait without receiving a Hello before declaring a neighbor down, must likewise match exactly between neighbors, alongside the closely related hello interval, since these timers govern the shared expectations both sides have for how frequently Hellos should arrive and how quickly a failure should be detected; Junos explicitly checks and rejects Hello packets carrying a mismatched dead interval value. Router priority, by contrast, is intentionally allowed to differ between neighbors on the same segment — it exists precisely so that administrators can differentiate router preference for the DR/BDR election, and differing values are expected and normal rather than being blocked. The designated router field, as advertised within each Hello, is informational about the sender's current view of the segment's DR and is not a value that must be identical between the two Hello senders to permit adjacency formation. Reference topics: Junos Enterprise Routing – OSPF, Required Hello Parameter Matching on Broadcast Networks.

The destination address 172.16.200.5 falls within the 172.16.0.0/16 aggregate's summarized range but does not fall within either of the two active, more-specific contributing routes actually present in the table — 172.16.10.0/24 and 172.16.99.0/24 — meaning no route more specific than the /16 itself exists to cover it. Under Junos's longest-match forwarding logic, the lookup for 172.16.200.5 therefore resolves to the aggregate route itself, and since aggregate routes are installed by default with a reject next hop rather than any real forwarding path, the router drops the packet and simultaneously generates an ICMP destination-unreachable message back to the originating source, explicitly signaling that no valid path exists for that specific destination even though a covering summary is being advertised. This reject behavior is precisely why aggregate routes are valuable for reducing the number of routes advertised upstream while still providing clear, immediate feedback for traffic aimed at address space within the summary that has no genuine underlying route, rather than silently black-holing it or misdirecting it toward an unrelated contributing route's next hop. The aggregate route itself remains active and installed throughout this process — a gap in contributing coverage does not deactivate the aggregate, since the aggregate's activation depends only on at least one contributing route being active, which is satisfied here by both existing /24 blocks. There is also no default route present in this scenario to fall back upon. Reference topics: Junos Enterprise Routing – Protocol Independent Routing, Aggregate Route Reject Behavior for Uncovered Address Space.

The BGP finite state machine defined in RFC 4271 progresses through Idle, Connect, Active, OpenSent, OpenConfirm, and finally Established. The Active state is entered either directly after Idle, when the local router begins retrying a TCP connection setup toward the configured peer, or after a previous Connect attempt has failed and the ConnectRetry timer has expired, prompting the router to keep trying to complete the underlying TCP three-way handshake. Seeing a peer parked in Active therefore means the local device has a fully valid neighbor configuration and is persistently attempting to reach the remote address on TCP port 179, but the handshake is not succeeding — common root causes include a firewall or ACL blocking TCP 179 between the two endpoints, an unreachable or incorrect peer IP address, the remote BGP process not running or not listening, or an asymmetric routing path preventing the SYN/ACK from returning. It does not indicate a misconfiguration on the local box in the sense of a missing statement (that would typically leave the session as Idle), nor does it indicate an established, functioning session exchanging UPDATE messages (that state is Established), and it is not a deliberately idle/disabled condition, which Junos reports plainly as Idle. Recognizing Active as 'trying to connect' rather than 'connected' is essential for correct BGP troubleshooting sequencing. Reference topics: Junos Enterprise Routing – BGP Fundamentals, BGP Finite State Machine and Session Verification.

This detailed adjacency output shows R3 maintaining four separate, fully Up adjacencies, evenly split between the two IS-IS levels. R1 and R2 are both formed at Level 1, confirming that R3 is directly adjacent to exactly two Level 1 neighbors within its local area, which validates that statement. R4 and R5 are both formed at Level 2, and Level 2 adjacencies are, by definition, part of the IS-IS backbone that interconnects areas; a router maintaining any Level 2 adjacency is by that fact participating in and connected to the Level 2 backbone, confirming R3's backbone connectivity as well. Every one of the four listed adjacencies explicitly shows 'Speaks: IP, IPv6' in its detail output, which is Junos's way of indicating that both the IPv4 and IPv6 address families have been successfully negotiated and are active over that circuit; this directly contradicts, rather than supports, the claim that IPv6 is disabled on these neighbors — if IPv6 were disabled, the Speaks field would list only IP. Regarding authentication, the output contains no field, flag, or indication whatsoever referencing authentication configuration or state for the R5 adjacency (or any adjacency); Junos would typically surface authentication-related information separately if it were configured and relevant, and its complete absence here means no basis exists in the exhibit to conclude authentication is required for that specific adjacency. Reference topics: Junos Enterprise Routing – IS-IS, Level 1 and Level 2 Adjacencies and Address Family Negotiation.

Layer 2 MAC learning on an EX Series switch, as on any standard Ethernet bridge, is a passive, frame-driven process rather than an active polling or query-based mechanism. Every time a frame arrives on any interface, the switch inspects the frame's source MAC address field and, if that address is not already present in the Ethernet switching (bridge) table for the associated VLAN, creates a new dynamic entry recording the source MAC address, the VLAN it was learned on, and the specific ingress interface through which the frame arrived. Junos also stamps each learned entry with an aging timestamp, which is refreshed every time a subsequent frame from that same source MAC is received; entries that receive no refreshing traffic within the configured MAC aging interval (300 seconds by default) are eventually purged from the table to keep it current and to reclaim table space from hosts that have moved or gone offline. This source-address-driven, per-frame learning process happens continuously and automatically with no dependency on spanning-tree state changes — although a topology change notification can trigger accelerated aging of the table to flush potentially stale entries faster, learning itself is not gated by or contingent upon such an event occurring. The switch never learns addresses from the destination field of a frame, since the destination address, if already known, is used purely for the forwarding lookup decision, not for populating new table entries. Reference topics: Junos Enterprise Switching – Layer 2 Switching Fundamentals, Source MAC Learning and Table Aging.

A classic and well-documented gotcha in filter-based forwarding deployments is that the static default route configured inside each forwarding instance frequently references a next-hop address that Junos cannot resolve, simply because the interface and other directly connected routes needed to validate that next hop as reachable exist only in the master inet.0 table by default, not automatically inside the newly created forwarding instance's own table. Since a static route's next hop must be resolvable against routes present within its own routing table to become active, the static default routes inside the ISP-A and ISP-B forwarding instances remain inactive precisely because the necessary interface/next-hop routes were never made visible inside those instances. The standard solution taught for this exact FBF scenario is to configure a routing information base (RIB) group that explicitly imports the relevant interface routes between the master inet.0 table and each forwarding instance's table, allowing the static default route's next hop inside each instance to resolve correctly against the leaked routes and become active. Applying a firewall filter without ever attaching it to an interface accomplishes nothing, since an unapplied filter never evaluates any traffic. Increasing the static route's preference value only affects which competing route wins selection and does nothing to resolve an unreachable next hop. Changing the instance type away from forwarding (to virtual-router) would in fact break FBF entirely, since filter-based forwarding specifically depends on the forwarding instance type working together with a routing-instance firewall filter action. Reference topics: Junos Enterprise Routing – Protocol Independent Routing, Filter-Based Forwarding and RIB Group Route Leaking.

OSPF relies on two IANA-reserved multicast addresses to distribute its control-plane traffic across broadcast and NBMA network types, and Link State Update (LSU) packets, which carry the actual LSAs being flooded, are addressed to one or the other depending on the role of the sending router. The address 224.0.0.5, designated AllSPFRouters, is used when any OSPF router — including a router that is itself the Designated Router or Backup Designated Router — needs to flood an LSU to every OSPF-speaking router on the segment; this is the address used for Hello packets universally and for LSU flooding directed at the entire segment. The address 224.0.0.6, designated AllDRouters, is used specifically by non-DR, non-BDR routers (DROthers) when they need to send an LSU or other update destined for the DR and BDR only, since only the DR and BDR actually listen on this address; the DR then takes responsibility for reflooding that information to the rest of the segment using 224.0.0.5. This two-address design is central to how OSPF achieves flooding efficiency on multi-access networks by funneling updates through the DR rather than requiring full-mesh flooding among every router pair. The addresses 224.0.0.8 and 224.0.0.9 are not used by OSPF at all; 224.0.0.9 is in fact reserved for RIPv2 multicast updates, making it a plausible-looking but incorrect distractor. Reference topics: Junos Enterprise Routing – OSPF, Multicast Addressing for Hello and Link State Update Packets.

By default, EBGP sessions are built with the expectation that peers are directly connected at Layer 3, and Junos enforces this by sending EBGP packets with a TTL of 1. When loopback addresses are used as the session endpoints instead of the directly connected physical interface addresses, the resulting IP packets must traverse at least one additional router hop between the two loopbacks, and a TTL of 1 will expire in transit before reaching the remote loopback, causing the TCP handshake — and therefore the BGP session — to fail even though a valid route to the peer's loopback exists. The multihop statement (configured as an EBGP multihop parameter with an accompanying TTL value, most commonly set to 2 for a single intermediate hop) instructs Junos to increase the TTL used for that peer's BGP packets so they survive the extra hop count between loopbacks. This is a mandatory addition any time an EBGP session is deliberately built against non-directly-connected addresses, whereas IBGP sessions, by contrast, do not have this default restriction because IBGP already assumes peers may be multiple hops apart within the same AS. Multipath affects load-balancing across equal-cost paths, damping suppresses flapping routes, and passive controls whether a router waits for the remote peer to initiate the TCP connection — none of these resolve the TTL expiration problem inherent to loopback-based EBGP peering. Reference topics: Junos Enterprise Routing – BGP, Configuring EBGP Multihop Sessions.

IS-IS is a link-state protocol that, like OSPF, runs Dijkstra's Shortest Path First algorithm independently on each router against its own copy of the synchronized link-state database to compute the best path toward every reachable destination. Each link within the topology carries an administrator-assigned or default metric, and as the SPF algorithm walks the topology graph from the local router outward, it sums the metrics of every link traversed along a candidate path to produce that path's total accumulated cost. Among all possible paths to a given destination prefix, IS-IS always selects and installs the path (or, in the case of equal-cost multipath, the set of paths) with the numerically lowest total accumulated metric, exactly mirroring the 'lowest cost wins' principle shared by essentially all link-state IGPs. A higher accumulated metric value is by definition a less preferred, more costly path, making that option the direct inverse of correct IS-IS behavior. Level 2 proximity to the destination has no independent bearing on path selection beyond however it happens to be reflected in the accumulated metric itself — IS-IS does not apply a separate rule preferring paths merely for passing near a Level 2 router. Likewise, LSP recency (sequence number or freshness) governs which version of a given LSP is trusted and flooded during database synchronization, ensuring the topology database itself is accurate and loop-free, but it plays no role in the SPF cost comparison once the database is synchronized and consistent. Reference topics: Junos Enterprise Routing – IS-IS, SPF Calculation and Metric-Based Path Selection.