JN0-664 Sample Questions Answers

Bootstrap messages are PIM messages that are used to distribute rendezvous point (RP) information dynamically during an RP election. Bootstrap messages are sent by bootstrap routers (BSRs), which are routers that are elected to perform the RP discovery function for a PIM sparse-mode domain. Bootstrap messages contain information about candidate RPs and their multicast groups, as well as BSR priority and hash mask length. Bootstrap messages are forwarded to all routers within a PIM sparse-mode domain using hop-by-hop flooding.

To create a summary route for IS-IS, you need to configure a policy statement that matches the prefixes to be summarized and sets the next-hop to discard. You also need to configure a summary-address statement under the IS-IS protocol hierarchy that references the policy statement. In this case, the policy statement leak-v6 is trying to match the prefix 2001:db9:a:fa00::/61 exactly, but this prefix is not advertised by any router in the network. Therefore, no summary route is created. To fix this, you need to delete the longer keyword from the route-filter term and change the prefix length to /61 exact. This will match any prefix that falls within the /61 range. You also need to delete the export statement under protocols isis, because this will export all routes that match the policy statement to other IS-IS routers, which is not desired for a summary route.

class-of-service (CoS) is a feature that allows you to prioritize and manage network traffic based on various criteria, such as application type, user group, or packet loss priority. CoS uses different components to classify, mark, queue, schedule, shape, and drop traffic according to the configured policies.

One of the components of CoS is drop profiles, which define how packets are dropped when a queue is congested. Drop profiles use random early detection (RED) algorithm to drop packets randomly before the queue is full, which helps to avoid global synchronization and improve network performance. Drop profiles can be discrete or interpolated. A discrete drop profile maps a specific fill level of a queue to a specific drop probability. An interpolated drop profile maps a range of fill levels of a queue to a range of drop probabilities and interpolates the values in between.

In the exhibit, we can see that the class-of-service configuration shows an interpolated drop profile with two fill levels (50 and 75) and two drop probabilities (20 and 60). Based on this configuration, we can infer the following statements:

The drop probability jumps immediately from 20% to 60% when the queue level reaches 75% full. This is not correct because the drop profile is interpolated, not discrete. This means that the drop probability gradually increases from 20% to 60% as the queue level increases from 50% full to 75% full. The drop probability for any fill level between 50% and 75% can be calculated by using linear interpolation formula.

The drop probability gradually increases from 20% to 60% as the queue level increases from 50% full to 75% full. This is correct because the drop profile is interpolated and uses linear interpolation formula to calculate the drop probability for any fill level between 50% and 75%. For example, if the fill level is 60%, the drop probability is 28%, which is calculated by using the formula: (60 - 50) / (75 - 50) * (60 - 20) + 20 = 28.

To use this drop profile, you reference it in a scheduler. This is correct because a scheduler is a component of CoS that determines how packets are dequeued from different queues and transmitted on an interface. A scheduler can reference a drop profile by using the random-detect statement under the [edit class-of-service schedulers] hierarchy level. For example: scheduler test { transmit-rate percent 10; buffer-size percent 10; random-detect test-profile; }

To use this drop profile, you apply it directly to an interface. This is not correct because a drop profile cannot be applied directly to an interface. A drop profile can only be referenced by a scheduler, which can be applied to an interface by using the scheduler-map statement under the [edit class-of-service interfaces] hierarchy level. For example: interfaces ge-0/0/0 { unit 0 { scheduler-map test-map; } }

BGP route target filtering can be configured on PE devices or on route reflectors (RRs). Configuring BGP route target filtering on RRs is more efficient and scalable, as it reduces the number of BGP sessions and updates between PE devices. To configure BGP route target filtering on RRs, the following steps are required:

Configure the family route-target statement under the BGP group or neighbor configuration on the RRs. This enables the exchange of the route-target address family between the RRs and their clients (PE devices). Configure the resolution rib bgp.l3vpn.0 resolution-ribs inet.0 statement under the routing-options configuration on the RRs. This enables the RRs to resolve next hops for VPN routes using the inet.0 routing table.

Intermediate System to Intermediate System (IS-IS) is a link-state routing protocol used to move information efficiently within a computer network. It uses a series of Protocol Data Units (PDUs) to manage the network's topology and ensure consistency across all routers in the network. Specifically, Link State PDUs (LSPs), Complete Sequence Number PDUs (CSNPs), and Partial Sequence Number PDUs (PSNPs) play crucial roles in this process.

1. **PSNPs (Partial Sequence Number PDUs)**:

- **Acknowledge a received LSP**: PSNPs are used to acknowledge the receipt of LSPs. When a router receives an LSP, it sends a PSNP back to the sender to confirm that the LSP has been received.

- **Request a missing LSP**: PSNPs are also used to request missing LSPs. If a router identifies a missing LSP based on sequence numbers, it can send a PSNP to request the specific LSP from its neighbors.

2. **CSNPs (Complete Sequence Number PDUs)**:

- **Summarize LSPs**: CSNPs are used to summarize all the LSPs known to a router. They are typically sent at regular intervals to provide a complete list of LSPs in a database. They are not used to acknowledge or request specific LSPs but provide an overview of all LSPs for database synchronization.

Based on this understanding, let's evaluate the statements:

- **A. PSNPs are used to acknowledge a received LSP.**

- Correct. PSNPs serve the purpose of acknowledging LSPs received from other routers.

- **B. CSNPs are used to acknowledge a received LSP.**

- Incorrect. CSNPs are not used for acknowledging LSPs; they are used to provide a summary of all LSPs.

- **C. CSNPs are used to request a missing LSP.**

- Incorrect. CSNPs are not used to request missing LSPs; this is the role of PSNPs.

- **D. PSNPs are used to request a missing LSP.**

- Correct. PSNPs are used to request specific missing LSPs when a router detects that it is missing information.

**Conclusion**:

The correct statements about IS-IS are:

**A. PSNPs are used to acknowledge a received LSP.**

**D. PSNPs are used to request a missing LSP.**

**References**:

- Juniper Networks Documentation on IS-IS: [IS-IS Overview](https://www.juniper.net/documentation/en_US/junos/topics/concept/is-is-routing-overview.html)

- RFC 1195, Use of OSI IS-IS for Routing in TCP/IP and Dual Environments: [RFC 1195](https://tools.ietf.org/html/rfc1195) which details the operation and use of IS-IS, including the roles of PSNPs and CSNPs.

the default behavior for iBGP is to propagate EBGP-learned prefixes without changing the next-hop. This can cause issues if the next-hop is not reachable via the IGP. One solution is to use the next-hop self command on R4, which will change the next-hop attribute to its own loopback address. This way, R5 can reach the next-hop via the IGP and install the route in its routing table.

Another solution is to add the external interface prefix (120.0.4.16/30) to the IGP routing tables of R4 and R5. This will also make the next-hop reachable via the IGP and allow R5 to use the route. According to 2, this is a possible workaround for a pure IP network, but it may not work well for an MPLS network.

The reason why the route is being hidden is that R5 cannot reach the BGP next hop 10.0.0.1, which is the address of R1. R5 does not have a route to 10.0.0.0/24 in its routing table, and neither does R4. Therefore, R5 cannot resolve the BGP next hop and marks the route as hidden.

There are two solutions that will solve this problem:

Option A: On R4, create a policy to change the BGP next hop to itself and apply it to IBGP as an export policy. This way, R5 will receive the route with a next hop of 172.16.1.2, which is reachable via the IGP. This solution is also known as next-hop-self1.

Option B: Add the external interface prefix to the IGP routing tables. This way, R4 and R5 will learn a route to 10.0.0.0/24 via the IGP and be able to resolve the BGP next hop. This solution is also known as recursive lookup2.

Option C is not correct because adding the internal interface prefix to the BGP routing tables will not help R5 reach the BGP next hop 10.0.0.1.

Option D is not correct because changing the BGP next hop to 172.16.1.1 on R4 will not help R5 either, since R5 does not have a route to 172.16.1.1 in its routing table.

References: 1: Configuring Next-Hop-Self for IBGP Peers 2: Understanding Recursive Lookup

To allow Site 1 to access three VLANs that are located in Site 2 and Site 3, you need to configure three L2VPN routing instances on PE-1, one for each VLAN. Each L2VPN routing instance will have a different VLAN ID and a different VNI for VXLAN encapsulation. Each L2VPN routing instance will also have a different vrf-target export value to identify which VPN routes belong to which VLAN. This way, PE-1 can forward traffic from Site 1 to Site 2 and Site 3 based on the VLAN tags and VNIs.

TLVs are tuples of (Type, Length, Value) that can be advertised in IS-IS packets. TLVs can carry different kinds of information in the Link State Packets (LSPs). IS-IS supports both narrow and wide metrics for link costs. Narrow metrics use a single octet to encode the link cost, while wide metrics use three octets. Narrow metrics have a maximum value of 63, while wide metrics have a maximum value of 16777215. If there are both narrow and wide metric devices in the topology, IS-IS will advertise two TLVs for each link: one with the narrow metric and one with the wide metric. This allows backward compatibility with older devices that only support narrow metrics12.

In the exhibit, the PE-to-CE protocol used is OSPF, and there is an OSPF neighborship between CE-1 and CE-2 within the same Area 0. Let's analyze the default OSPF routing behavior in this setup to determine the correct statement.

1. **OSPF Neighborship**:

- CE-1 and CE-2 have an OSPF neighborship directly within Area 0.

- OSPF prefers intra-area routes over inter-area and external routes.

2. **Default Routing Behavior**:

- Since CE-1 and CE-2 are directly connected through an OSPF link within the same area, OSPF will prefer this direct intra-area path over any other paths learned via the PE routers and the L3VPN.

- This is because intra-area routes have a lower metric compared to inter-area or external routes.

3. **Metric Considerations**:

- By default, OSPF will route traffic between Site-1 and Site-2 through the direct link between CE-1 and CE-2, unless the link's metric is artificially increased to make it less preferable.

- There is no need to adjust metrics for the CE-1 to PE-1 link to prefer the CE-1 to CE-2 path, as OSPF already prefers direct intra-area paths.

**Conclusion**:

Given the default behavior of OSPF and the topology shown in the exhibit, the correct statement is:

**B. Hosts at Site-1 will reach hosts at Site-2 through the CE-1 and CE-2 link by default.**

**References**:

- OSPF Design Guide: [Juniper Networks OSPF Design Guide](https://www.juniper.net/documentation/en_US/junos/topics/concept/ospf-design-overview.html)

- Juniper Networks Technical Documentation on OSPF: [Junos OS OSPF Configuration Guide](https://www.juniper.net/documentation/en_US/junos/topics/concept/ospf-routing-overview.html)

The attached bit is a flag in an IS-IS LSP that indicates whether a router is connected to another area or level (L2) of the network. By default, L2 routers set this bit when they advertise their LSPs to L1 routers, and L1 routers use this bit to select a default route to reach other areas or levels through L2 routers. However, this may result in suboptimal routing if there are multiple L2 routers with different paths to other areas or levels. To ensure that L1 routers have only the most specific routes available from L2 routers, you can configure the ignore-attached-bit parameter on all L1 routers. This makes L1 routers ignore the attached bit and install all interarea routes learned from L2 routers in their routing tables.

A sham link is a logical link between two PE routers that belong to the same OSPF area but are connected through an L3VPN. A sham link makes the PE routers appear as if they are directly connected, and prevents OSPF from preferring an intra-area back door link over the VPN backbone. A sham link creates an OSPF multihop neighborship between the PE routers using TCP port 646. The PEs exchange Type 1 OSPF LSAs instead of Type 3 OSPF LSAs for the L3VPN routes, which allows OSPF to use the correct metric for route selection1.

In IS-IS, a designated intermediate system (DIS) is a router that is elected on a multi-access network segment (such as Ethernet) to perform some functions on behalf of other routers on the same segment. A DIS is responsible for sending network link-state advertisements (LSPs), which describe all the routers attached to the network. These LSPs are flooded throughout a single area. A DIS also generates pseudonode LSPs, which represent the multi-access network as a single node in the link-state database. A DIS election is based on the priority value configured on each router’s interface connected to the multi-access network. The priority value ranges from 0 to 127, with higher values indicating higher priority. The router with the highest priority becomes the DIS for the area (Level 1, Level 2, or both). If routers have the same priority, then the router with the highest MAC address is elected as the DIS. By default, routers have a priority value of 64. On a multi-access network, each router only forms an adjacency to the DIS, not to every other router on the segment. This reduces the amount of hello packets and LSP

In the provided exhibit, the configuration involves using a RIB (Routing Information Base) group to facilitate internet access for VPN-A Site 1 through PE-1. The goal is to provide VRF Internet access over a single connection.

1. **Understanding RIB Groups**:

- RIB groups allow for the import and export of routes between different routing tables.

- In this scenario, we have two RIBs: `inet.0` (the main routing table) and `VPN-A.inet.0` (the VRF-specific routing table).

2. **Statement Analysis**:

- **A. You must use the RIB group to move a default route, which is learned through BGP, from the inet.0 table to the VPN-A.inet.0 table.**

- Correct. To provide Internet access to VPN-A, the default route (0.0.0.0/0) learned via BGP in the `inet.0` table must be made available in the `VPN-A.inet.0` table. This is done using the RIB group to import the default route.

- **B. You do not need to use the RIB group to move interface routes from the inet.0 table to the VPN-A.inet.0 table.**

- Correct. Interface routes (connected routes) are typically directly added to both the global and the VRF routing tables without needing a RIB group. These routes are known to the VRF because the interfaces are part of the VRF configuration.

- **C. You do not need to use the RIB group default route, which is learned through BGP, from the inet.0 table to the VPN-A.inet.0 table.**

- Incorrect. As discussed, the default route needs to be imported into the VRF's routing table using a RIB group to enable Internet access for the VRF.

- **D. You must use the RIB group to move interface routes from the inet.0 table to the VPN-A.inet.0 table.**

- Incorrect. Interface routes are directly associated with the VRF interfaces and are automatically known to the VRF routing table. There is no need to use a RIB group for these routes.

**Conclusion**:

The correct answers are:

**A. You must use the RIB group to move a default route, which is learned through BGP, from the inet.0 table to the VPN-A.inet.0 table.**

**B. You do not need to use the RIB group to move interface routes from the inet.0 table to the VPN-A.inet.0 table.**

**References**:

- Juniper Networks Documentation on RIB Groups: [RIB Groups Overview](https://www.juniper.net/documentation/en_US/junos/topics/concept/rib-groups-overview.html)

- Junos OS VPNs Configuration Guide: [Junos VPNs Configuration](https://www.juniper.net/documentation/en_US/junos/topics/concept/vpns-overview.html)

VPLS is a technology that provides Layer 2 VPN services over an MPLS network. VPLS uses BGP as its control protocol to exchange VPN membership information between PE routers. The route target is a BGP extended community attribute that identifies which VPN a route belongs to. The route target must match on PE routers that participate in the same VPLS instance, otherwise they will not accept or advertise routes for that VPLS.

The class-of-service (CoS) configuration in the exhibit shows how traffic is scheduled on the ge-0/0/0 interface. Let's analyze each statement to determine its correctness:

A. Incoming traffic will not be classified because no classifier exists in the configuration.

This statement is correct. The configuration shown does not include any classifier, so no explicit classification is defined. As a result, incoming traffic will not be classified according to any custom criteria.

B. The best-effort queue can transmit more than 40% of the total bandwidth on the ge-0/0/0 interface, if no other queue is using that bandwidth.

This statement is correct. The transmit-rate percent 40 means that 40% of the bandwidth is guaranteed for the best-effort queue, but it can use more bandwidth if other queues (like the priority scheduler) are not utilizing their allocated bandwidth.

C. Incoming traffic will be classified using the default classifier.

This statement is incorrect. Without an explicit classifier in the configuration, there is no mention of a default classifier being used. Therefore, the incoming traffic won't be classified based on the configuration shown.

D. The best-effort queue can never transmit more than 40% of the total bandwidth on the ge-0/0/0 interface, even if that bandwidth is available.

This statement is incorrect. The transmit-rate percent 40 sets a guaranteed minimum bandwidth but does not set a maximum limit. The best-effort queue can utilize more bandwidth if other queues are not using their allocated portions.

In the given exhibit, you are observing the BGP routing information for the prefix 10.10.0.0/24. The AS path for this prefix shows `65000 {65137 65224}`. To understand the issue, let's analyze each aspect of the information provided and the options given:

1. **AS Path Analysis**:

- The AS path attribute in BGP is a list of AS numbers that a route advertisement has traversed.

- In this case, the AS path `65000 {65137 65224}` indicates that the route to 10.10.0.0/24 has been advertised through AS 65000, which includes AS 65137 and AS 65224.

2. **Understanding AS Path Prepending**:

- AS path prepending is a technique used by AS administrators to artificially lengthen the AS path.

- By adding their own AS number multiple times into the AS path, they make a route less attractive to others.

- Here, AS 65000 is showing `65137` as part of its AS path, suggesting it might be prepending to manipulate routing decisions.

3. **Options Analysis**:

- **Option A**: "AS 65000 is pre-pending AS 65137 to route advertisements."

- This option suggests that AS 65000 is deliberately adding AS 65137 to the AS path. This matches the observed AS path, where AS 65000 has prepended `65137`.

- Therefore, this is the correct explanation.

- **Option B**: "The local AS is receiving two equal cost routes to 10.10.0.0/24."

- There is no evidence in the exhibit to support the presence of two equal-cost routes.

- **Option C**: "The local AS is in the process of withdrawing the route from AS 65137."

- Route withdrawal would not cause the AS path to include `65000 {65137 65224}`.

- **Option D**: "AS 65137 is advertising the 10.10.0.0/24 prefix."

- While AS 65137 is part of the path, it does not explain the presence of AS 65000 in the path, making this option incorrect.

**Conclusion**:

The AS path `65000 {65137 65224}` is indicative of AS 65000 prepending AS 65137. Therefore, the correct answer is:

**A. AS 65000 is pre-pending AS 65137 to route advertisements.**

**References**:

- Juniper Networks documentation on BGP AS path manipulation and prepending techniques.

- BGP Best Practices and Routing Policies: [Juniper Networks BGP Best Practices](https://www.juniper.net/documentation/en_US/junos/topics/concept/bgp-best-practices-routing-policies.html)

- RFC 4271, A Border Gateway Protocol 4 (BGP-4): [RFC 4271](https://tools.ietf.org/html/rfc4271) which describes the behavior and attributes of BGP, including AS path prepending.

To summarize routes from the 203.0.113.128/25 IP block on R8 to AS 64500, you need to do the following:

Add the set routing-options static route 203.0.113.128/25 discard command. This creates a static route for the summary prefix and discards any traffic destined to it. This is necessary because BGP can only advertise routes that are present in the routing table.

Replace exact in the export policy with orlonger. This allows R8 to match and advertise any route that is equal or more specific than the summary prefix. The exact term only matches routes that are exactly equal to the summary prefix, which is not present in the routing table.

In PIM-SM (Protocol Independent Multicast - Sparse Mode), the Designated Router (DR) plays a crucial role in multicast forwarding. The DR is responsible for various tasks depending on whether it is connected to the source or the receiver. Let's analyze each statement regarding the PIM DR in a PIM-SM domain.

1. **Statement A: The source DR sends PIM register messages from the source network to the RP.**

- Correct. In PIM-SM, the DR on the source's local network is responsible for encapsulating multicast packets in PIM Register messages and sending them to the Rendezvous Point (RP). This process ensures that the RP is aware of active sources.

2. **Statement B: If the DR priorities match, the router with the lowest IP address is selected as the DR.**

- Incorrect. The correct rule is that if the DR priorities match, the router with the **highest** IP address is selected as the DR. The election process first compares priorities; if priorities are equal, the IP addresses are compared to select the DR.

3. **Statement C: The receiver DR sends PIM join and PIM prune messages from the receiver network toward the RP.**

- Correct. In PIM-SM, the DR on the receiver's local network sends PIM Join messages toward the RP to join the multicast distribution tree. Similarly, it sends PIM Prune messages to leave the tree when there are no interested receivers.

4. **Statement D: By default, PIM DR election is performed on point-to-point links.**

- Incorrect. By default, PIM DR election is performed on multi-access networks (e.g., Ethernet). On point-to-point links, there is no need for a DR election as there are only two routers involved.

**Conclusion**:

The correct statements regarding the PIM DR in a PIM-SM domain are:

**A. The source DR sends PIM register messages from the source network to the RP.**

**C. The receiver DR sends PIM join and PIM prune messages from the receiver network toward the RP.**

**References**:

- Juniper Networks Documentation on PIM-SM: [PIM-SM Overview](https://www.juniper.net/documentation/en_US/junos/topics/concept/pim-sparse-mode-overview.html)

- RFC 7761, Protocol Independent Multicast - Sparse Mode (PIM-SM): [RFC 7761](https://tools.ietf.org/html/rfc7761) which details the PIM-SM protocol, including DR roles and election procedures.

IS-IS is a link-state routing protocol that uses the Dijkstra algorithm to compute the shortest paths between nodes in a network. The Dijkstra algorithm maintains three data structures: a tree database, a candidate database, and a link-state database (LSDB). The tree database contains the nodes that have been visited and their shortest distances from the source node. The candidate database contains the nodes that have not been visited yet and their tentative distances from the source node. The LSDB contains the topology information of the network, such as the links and their costs.

The Dijkstra algorithm works as follows:

The local router moves its own local tuples into the tree database. A tuple consists of a node ID, a distance, and a parent node ID. The local router’s tuple has a distance of zero and no parent node.

The local router moves its neighbors’ tuples into the candidate database. The neighbors’ tuples have distances equal to the costs of the links to them and parent node IDs equal to the local router’s node ID.

The local router selects the tuple with the lowest distance from the candidate database and moves it to the tree database. This tuple becomes the current node.

The local router updates the distances of the current node’s neighbors in the candidate database by adding the current node’s distance to the link costs. If a shorter distance is found, the parent node ID is also updated.

The algorithm repeats steps 3 and 4 until either the destination node is reached or the candidate database is empty.

The customer interface in an LDP-signaled pseudowire is the interface on the PE router that connects to the CE device. An LDP-signaled pseudowire is a type of Layer 2 circuit that uses LDP to establish a point-to-point connection between two PE routers over an MPLS network. The customer interface can have different encapsulation types depending on the type of traffic that is carried over the pseudowire. The encapsulation types are ethernet-ccc, vlan-ccc, extended-vlan-ccc, atm-ccc, frame-relay-ccc, ppp-ccc, cisco-hdlc-ccc, and tcc-ccc. Depending on the encapsulation type, the customer interface can accept or reject tagged or untagged frames in the data plane, and include or exclude VLAN tags in the control plane LDP advertisement. The following table summarizes the behavior of different encapsulation types: