Pass the Juniper JNCIP-SP JN0-664 Questions and answers with ValidTests

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.

The issue arises because R3’s group-range (224.1.1.0/28) is more specific than R2’s group-range (224.1.1.0/24). In PIM bootstrap (BSR), the RP with the longest prefix (most specific group-range) is preferred, regardless of priority. Even though R3 has a higher bootstrap priority (210 vs. R2’s 200), its more specific /28 group-range takes precedence for groups within 224.1.1.0/28.

Why Option D is Correct:

To force R4 to use R2 for all joins, R2’s group-range must be more specific than R3’s. For example:

If R2’s group-range is changed to 224.1.1.0/28 (same as R3) but with a higher priority, R2 would win (priority is compared only when group-ranges are equal).

If R2’s group-range is changed to 224.1.1.0/29 (more specific than /28), it will override R3’s /28 for groups in the /29 range.

The key is prefix specificity, which overrides priority in BSR elections.

Why Other Options Are Incorrect:

A. Change bootstrap priority on R2 to be higher than R3:

Priority is evaluated only when group-ranges are identical. Since R3’s group-range (/28) is more specific than R2’s (/24), R3 will still win for groups in 224.1.1.0/28, even if R2’s priority is higher.

B. Change the default route in inet.2 on R4:

RPF routes (inet.2) determine how traffic reaches the RP, but they do not influence RP election logic (BSR priority/group-range).

C. Change R2’s local address to be higher than R3’s:

The RP address is a tiebreaker only if priorities and group-ranges are equal. Since R3’s group-range is more specific, this change has no impact.

Key Takeaways:

BSR RP Election Order:

Longest group prefix (most specific).

Highest priority (if prefixes are equal).

Highest RP address (if prefixes and priorities are equal).

To override R3, R2 must advertise a more specific group-range (e.g., /28 or smaller) to ensure it is selected for the desired multicast groups.

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.

Option A (Correct):

In IS-IS, the Designated Intermediate System (DIS) is elected based on the highest configured priority (as defined in Junos OS).

If priorities are equal, the router with the highest MAC address becomes the DIS.

A priority value of 10 will always override a lower priority (e.g., 1).

In the exhibit, we see an internal BGP (iBGP) setup within AS 65512, and an external BGP (eBGP) connection between R3 and ISP-A (AS 65511). The questions focus on the behavior of BGP routes advertised from R3 to R1 within the same AS.

1. **BGP Next-Hop Attribute (Option A and D)**:

- In iBGP, the next-hop attribute is **not** changed when a route is advertised to another iBGP peer. This means that when R3 advertises a route to R1, it retains the original next-hop value as learned from the eBGP peer (ISP-A).

- Therefore, Option D is correct: "By default, the next-hop value for these routes is not changed by R3 before being sent to R1."

2. **BGP Attributes (Option B and C)**:

- BGP attributes such as local preference, AS-path, and others are crucial for BGP route selection. The local preference attribute is used within an AS to indicate the preferred path for outbound traffic.

- When R3 advertises BGP routes to R1, it includes the local preference value assigned to those routes. This value is not removed and is propagated within the iBGP mesh.

- Therefore, Option C is correct: "By default, the BGP local-preference value that is assigned on R3 is advertised to R1."

**References**:

- Juniper Networks documentation on BGP behavior provides detailed insights into the propagation of BGP attributes within iBGP and eBGP contexts. Specifically, the Junos OS documentation covers the default behavior of next-hop and local preference attributes in BGP configurations.

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

- For a deeper understanding of BGP attributes and their default behaviors, the "Juniper Networks Day One: Exploring BGP" book is an excellent resource.

https://www.juniper.net/documentation/us/en/software/junos/ospf/topics/topic-map/configuring-ospfv2-sham-links.html

The Dijkstra algorithm in IS-IS operates as follows:

Tree Database Initialization: The local router (root) is added to the tree database with a cost of 0.

Candidate Database Population: Neighbors of the root (from the LSDB) are placed into the candidate database with their associated costs.

Processing Nodes: The node with the lowest cost in the candidate database is moved to the tree database.

Neighbor Evaluation: For each neighbor of the newly added node (from the LSDB), if the neighbor is not already in the tree or candidate database, it is added to the candidate database. If it exists in the candidate with a higher cost, it is updated with the lower cost.

Termination: The algorithm stops when the candidate database is empty, ensuring all shortest paths are computed.

Analysis of Options:

A. Incorrect. The local router is placed directly into the tree database, not the candidate database.

B. Correct (with context). When a node is added to the tree database, its neighbors (existing in the LSDB) are evaluated. If these neighbors are not already in the tree or candidate database, they are added (not "moved") to the candidate database. The wording "moved" is technically inaccurate, but this option aligns closest with the process of populating the candidate database using LSDB entries during tree database processing.

C. Incorrect. Tuples (nodes) with the lowest cost are moved from the candidate database to the tree database, not from the tree to the LSDB. The LSDB remains static during SPF computation.

D. Incorrect. The algorithm stops when the candidate database is empty, not the tree database. The tree database grows as nodes are processed.

https://www.juniper.net/documentation/us/en/software/junos/bgp/topics/ref/statement/multihop-edit-protocols-bgp.html