Free Juniper JN0-364 Practice Exam with Questions & Answers

Multiple Spanning Tree Protocol (MSTP), as defined in IEEE 802.1s and implemented in Juniper Networks Junos OS, allows for the grouping of VLANs into specific spanning tree instances. This provides significant scalability and load-balancing advantages over traditional STP or RSTP. To achieve this, switches must be grouped into logical "Regions."

According to Juniper documentation, for two or more switches to be considered part of the sameMSTP Region, they must possess an identicalMSTP Configuration Identifier. This identifier consists of three specific attributes that must match exactly across all participating switches:

MSTI Name (Region Name):A descriptive string (up to 32 characters) that identifies the region.

MSTI Revision Level:A numerical value (0–65535) used to track configuration changes.

VLAN-to-Instance Mapping:The specific table that defines which VLAN IDs are associated with which Multiple Spanning Tree Instances (MSTIs).

If even one of these parameters—such as theRegion name(Option A)—differs, the switches will treat each other as being in separate regions. When switches are in different regions, they interact using theCommon Spanning Tree (CST), effectively seeing the other region as a single "virtual bridge," which limits the granularity of traffic engineering.

TheExtended system ID(Option B) is a component of the Bridge ID used to carry VLAN information in PVST+ but is not a region-matching requirement.Root bridge priority(Option C) andRoot bridge ID(Option D) are variables used during the STP election process to determine the topology's root, but they do not define the boundaries of an MSTP region itself.

In the Junos OS architecture,route preference(often referred to as administrative distance in other vendor platforms) is the primary metric used by the Routing Engine to select the "best" path when multiple protocols provide a route to the same destination. Each routing protocol and route type is assigned a default numeric value; the lower the value, the more preferred the route.

According to Juniper Networks technical documentation, anaggregate routeis assigned a default preference of130. Aggregate routes are a form of static-like route used to group specific routes into a single, broader prefix to reduce the size of routing tables and limit the scope of routing updates. They are "protocol-independent" because they are not learned from a dynamic neighbor but are manually defined by the administrator.

To understand where130fits in the hierarchy, it is helpful to compare it with other common Junos preferences:

Directly connected interfaces:0

Static routes:5

OSPF Internal:10

IS-IS Level 1/2:15/18

Aggregate routes: 130

OSPF AS External:150

BGP (Internal and External):170

Generated routes:150

By setting the aggregate route preference to 130, Junos ensures that specific routes learned via IGPs (like OSPF or IS-IS) are preferred over the aggregate. This is essential because an aggregate route is often used as a "catch-all" or a discard route when more specific path information is missing. If the aggregate had a lower preference (like 5), it might override dynamic routing information, leading to suboptimal routing or black-holed traffic.

In a Juniper Networks environment, deployingRSVP-signaled LSPsrequires a functionalTraffic Engineering Database (TED). This database is populated by the Interior Gateway Protocol (IGP) using specific extensions that carry link-state information beyond simple reachability, such as available bandwidth, administrative groups (link coloring), and Maximum Reservable Bandwidth.

The behavior of these extensions differs betweenOSPFandIS-ISin Junos OS:

OSPF (Option C):By default, OSPF is a "pure" routing protocol. To support RSVP-TE, it must carry Opaque LSAs (Type 10). According to Juniper documentation, you mustexplicitly configuretraffic engineering within the OSPF protocol hierarchy using the set protocols ospf traffic-engineering command. Without this command, OSPF will not flood the TE information required by the Constrained Shortest Path First (CSPF) algorithm, and LSPs will fail to establish.

IS-IS (Option D):IS-IS was designed to be extensible through the use of TLVs (Type, Length, Value). In Junos OS,IS-IS traffic engineering extensions are enabled by defaultonce the protocol is active. As soon as you enable IS-IS on an interface, it begins to advertise the wide metrics and TE TLVs (like TLV 22 and 135) necessary for building the TED.

This distinction is a common design consideration for network architects. While IS-IS simplifies the rollout of MPLS by having TE enabled "out of the box," OSPF requires that extra configuration step to transition from a standard IGP to a TE-aware protocol.

TheBorder Gateway Protocol (BGP)operates based on a strict set of advertisement rules designed to prevent routing loops while ensuring global reachability. These rules differ significantly depending on whether the relationship isExternal BGP (EBGP)orInternal BGP (IBGP).

1. EBGP Advertisement (Option A):In a standard EBGP scenario, a router acts as an exit/entry point for an Autonomous System. When an EBGP speaker receives a valid route from any peer (Internal or External), it will, by default, advertise that route to all of its other EBGP peers. This is the primary mechanism that allows prefixes to propagate across the global internet from one AS to another.

2. IBGP Split Horizon (Option D):

The most critical rule within an AS is theIBGP Split Horizonrule. To prevent loops within an AS, BGP dictates that a route learned from an IBGP peermust notbe advertised to any other IBGP peer. This is why BGP requires a "full mesh" of IBGP sessions or the use ofRoute Reflectorsto ensure all internal routers learn all routes. Without this rule, a route could circulate infinitely within the AS because IBGP does not update the AS_PATH attribute.

3. EBGP to IBGP Propagation (Option B):

When a router learns a route from an EBGP peer, it is permitted to advertise that route to all of its IBGP peers. This ensures that everyone inside the network knows how to reach external destinations. However, it is important to remember that in Junos OS, theBGP Next Hopis not modified by default when sending routes to IBGP peers, often requiring a "next-hop-self" policy to ensure internal reachability.

Options C and E are incorrect because they directly contradict these fundamental BGP loop-prevention and propagation mechanisms.

In the BGP finite state machine, theIdlestate is the "stop" or "start" point of the protocol. When a session is stuck in Idle, it means the BGP process is either administratively disabled or, more commonly, is unable to initiate the underlying TCP connection required for BGP.

According to Juniper Networks Service Provider documentation, the most common reason for a BGP session to remain in Idle is a lack ofrouting reachability. For BGP to move to theConnectstate, the Junos kernel must have a route to the IP address specified in the neighbor statement. If thepeer IP address is unreachable (Option A)—meaning there is no route in inet.0 (via OSPF, IS-IS, or static)—the router cannot initiate the TCP three-way handshake on port 179. Consequently, the state machine will never progress.

Analysis of incorrect options:

Option B:BGP does not care if the local AS is higher or lower than the peer's; it only cares if they match the configuration. AS numbers are identifiers, not priorities.

Option C:A mismatchedRouter IDdoes not prevent a session from leaving the Idle state. It would typically cause the session to reach theOpenConfirmstate, and then fail with a "Notification" message due to a collision or identification error.

Option D:While a mismatchedgroup type(internal vs. external) will cause the session to fail, it usually fails during theOpenmessage exchange (OpenSent state) because the AS numbers provided will not match the expected peer type (IBGP vs. EBGP).

Only the lack of a path to the neighbor (reachability) keeps the session at the very beginning of the process: theIdlestate.

In the provided exhibit, the output of the command show spanning-tree interface for switch1 reveals critical details about the Spanning Tree Protocol (STP) operational state.

The first correct statement is thatthe switch1 device is the root bridge(Option B). This is determined by comparing the "Port ID" column with the "Designated port ID" column, as well as checking the "Designated bridge ID". In the exhibit, for every interface listed (from ge-0/0/6.0 to ge-0/0/13.0), the Port ID and the Designated port ID are identical. Furthermore, every port is in the "FWD" (Forwarding) state with the "DESG" (Designated) role. In a Spanning Tree topology, the root bridge is the only device where all active participating interfaces serve as designated ports, as it has no need for a "Root" port role (which points toward a root bridge).

The second correct statement is thatthe bridge priority for switch1 is 32k(Option D). Looking at the "Designated bridge ID" column, we see the value 32768.0019e2552481. In Junos and general networking standards, the Bridge ID is composed of a bridge priority and the device's MAC address. The default priority for most Spanning Tree variants (STP, RSTP, MSTP) is 32,768, which is commonly referred to in shorthand as "32k".

Regarding the incorrect options:

Option A:There is no evidence of VSTP (VLAN Spanning Tree Protocol); the output shows "instance 0," which is typical for IEEE standard RSTP or STP.

Option C:The Port IDs for ge-0/0/8, ge-0/0/9, and ge-0/0/11 all start with "32" (e.g., 32:521), whereas the default port priority is typically 128 (as seen in ge-0/0/6.0 with 128:519). This indicates that the interface priorities for these specific ports have been manually tuned to a non-default value.

TheBGP path selection algorithmis 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 ahigher local preferenceagainst a path with ashorter AS path. Because theLocal Preferencecheck occurs at Step 1 and theAS_PATHcheck 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.

In standard routing, astatic routeis typically considered valid only if the specified next-hop IP address is directly reachable on a local subnet. However, in complex service provider designs, the next-hop might be a "distant" IP address that is reachable through another route (such as a BGP route or another static route). This process of looking up a next-hop within another routing entry is calledrecursive lookup.

In Junos OS, theresolve (Option A)parameter is explicitly used to enable this behavior for static routes. According to Juniper technical documentation, when you append the resolve keyword to a static route configuration, you are instructing the Routing Engine to search the routing table to find a path to that distant next-hop.

For example:

set routing-options static route 10.1.1.0/24 next-hop 192.168.100.1 resolve

If 192.168.100.1 is not on a local interface but is reachable via an OSPF route, the router will "resolve" the path and install the 10.1.1.0/24 route into the forwarding table using the OSPF path's exit interface.

Why other options are incorrect:

Discard (Option B)andReject (Option C)are "next-hop types" used to drop traffic, either silently (discard) or by sending an ICMP unreachable message (reject).

Next-table (Option D)is used forInter-VRF routing, where the router is told to look up the destination in a completely different routing instance (like a VRF table), which is a different architectural function than a recursive next-hop lookup within the same table.

In a Multiprotocol Label Switching (MPLS) environment, label operations are categorized into three primary actions:Push(adding a label),Swap(replacing a label), andPop(removing a label). The specific behavior described in the question refers to a mechanism calledPenultimate Hop Popping (PHP).

According to Juniper Networks technical documentation, the goal of PHP is to improve forwarding efficiency at the egress point of a Label-Switched Path (LSP). TheEgress Label Edge Router (LER), which is the final destination for the LSP, would normally have to perform two lookups if it received a labeled packet: first, it would look up the label in its MPLS table to see it is the destination, and second, it would look up the underlying IP payload in its IP routing table (inet.0) to forward the packet.

To alleviate this burden, the Egress LER signals a special label value calledImplicit Null (Label 3)to its upstream neighbor (the penultimate router) during the signaling process (RSVP or LDP). When thepenultimate routerreceives a packet destined for that egress LER, it sees the instruction to pop the transport label. Consequently, the penultimate router performs aPopoperation, stripping away the outer MPLS label and sending the raw IP packet (or the remaining inner service label) to the Egress LER.

This allows the Egress LER to perform only a single lookup. If the transport label was the only label, the Egress LER simply performs a standard IP lookup. If there is a VPN label remaining, it performs a single MPLS lookup for the VRF. This "default" behavior in Junos OS optimizes the performance of the egress router by offloading the final label removal to the penultimate hop. Note that ifUltimate Hop Popping (UHP)were configured (via the explicit-null command), the penultimate router would perform aSwapto Label 0 instead of a Pop.

In Junos OS, the flow of routing information is managed by policies that sit between the protocol's database (the RIB-In/LSDB) and the main routing table (inet.0). Understanding the direction of these policies is critical for correct configuration.

Animport policy (Option B)is used to control the movement of routes from a routing protocol into the routing table. According to Juniper Service Provider documentation, even though IS-IS is a link-state protocol that requires all routers in an area to have an identical Link-State Database (LSDB), animport policycan be used to filter which of those validated routes are actually placed into inet.0 for forwarding. For external routes (routes leaked into IS-IS from other areas or protocols), an import policy allows an administrator to selectively accept or reject prefixes based on specific criteria like prefix-lists or community tags.

It is important to distinguish this from anexport policy (Option A). In Junos, an export policy is used to take routesalready inthe routing table and push themoutto a protocol to be advertised to neighbors. For example, you would use an export policy to redistribute static routes into IS-IS.Route preference (Option C)is a global value used to select between different protocols for the same prefix, and theinterface metric (Option D)is used by the SPF algorithm to calculate the shortest path within the IS-IS database itself. Therefore, to specifically control which learned external routes are "installed" into the forwarding table, theimport policyis the correct tool.