(Jan-2024) 4A0-116 Exam Dumps Contains FREE Real Quesions from the Actual Exam [Q15-Q30] : Free Exams Dumps Materials : http://exams.dumpsmaterials.com

NEW QUESTION 15
Which of the following statements about a Segment Routing SID is FALSE?

A local Node-SID can be configured directly as an MPLS label.

A router advertises its local Node-SID as a local SRGB and an index only if it is configured as an index.

All routers do NOT need to have the same SRGB range configured.

A local Node-SID can be configured as an index.

NEW QUESTION 16
Which of the following list of SR-TE attributes has to be advertised among routers?

Administrative groups that each link belongs to, TE metric of links, bandwidth availability of each link, SRLG that each link belongs to.

Administrative groups that each link belongs to, TE metric of links, SRLG that each link belongs to.

Administrative groups that each link belongs to, TE metric of links, bandwidth availability of each link, SRLG that each link belongs to, link status up/down.

Administrative groups that each link belongs to, TE metric of links, SRLG that each link belongs to, link status up/down.

NEW QUESTION 17
Which of the following statements about a Segment Routing SID is FALSE?

A Node-SID is usually associated with a router’s system interface.

A Prefix-SID can be configured directly as a label value or indirectly as an index.

Adjacency-SID values are taken from the SRGB configured for the routing protocol.

An Adjacency-SID does not have to be configured.

NEW QUESTION 18
Which of the following statements about the Path Computation Element (PCE) is FALSE?

The PCE can obtain topology and traffic-engineering information from the network using either a link-state IGP or BGP-LS.

A stateful PCE proactively monitors all the existing LSPs and triggers the necessary repairs and re-optimizations.

A stateless PCE can calculate cross-area traffic-engineering-constrained LSP paths.

A stateful PCE can allow LSPs to reserve bandwidth.

NEW QUESTION 19
Which of the following statements about path definitions is FALSE?

Once a path is associated with an LSP, it cannot be used by other LSPs.

A loose hop is one that does not have to be directly adjacent to the previous hop in the path list

The path hops can be defined by either the system or physical interface IP address.

In addition to the hops defined in the path list, the head-end and tail-end routers are implicitly added.

NEW QUESTION 20
Based on the exhibit, which of the following is a viable option for the Path Computation Element (PCE) to obtain all the necessary topology and traffic-engineering information from the network, so that it can calculate LSP paths on behalf of the PE routers?

Establishing an IGP adjacency with router R2

Establishing IGP adjacencies with routers R1 and R2

Establishing a BGP session using the BGP-LS address family with router R3

Establishing BGP sessions using the BGP-LS address family with routers R3 and R4

NEW QUESTION 21
The exhibit presents packets being transmitted inside an LSP’s multi-segment primary path going from router R1 to router R8. The LSP also has a standby secondary path, and Seamless-BFD has been enabled on the primary path. The link between routers R1 and R2 fails, and fast re-route (FRR) is triggered. As a result, router R1 forwards the packets to router R3 and adds the proper FRR encapsulation to reach which router?

To reach router R2, which is the LSP’s intended next-hop.

To reach router R5, which is the shortest way to go back to the original path.

To reach router R4, which is the tail-end of the active segment.

To reach router R8, which is the tail-end of the LSP.

NEW QUESTION 22
Which of the following is NOT an advantage of using a PCE for the computation of TE-constrained LSP paths, as compared to using CSPF locally on the PE router?

The ability to create cross-area TE-constrained LSP paths

The ability to create LSP paths with bandwidth reservation

The ability to create LSPs with primary and secondary paths

The ability to ensure that some LSP paths are disjoint

NEW QUESTION 23
Which of the following is an advantage of enabling label stack reduction for a CSPF-calculated path, as compared to using plain CSPF?

The number of hops included in the end-to-end path is reduced.

The path calculation can be delegated to an external path computation element (PCE).

There is a larger list of traffic-engineering constraint types that can be imposed on the LSP path.

The routers in the calculated path can take advantage of ECMP to better distribute the traffic load.

NEW QUESTION 24
Examine the exhibit. Based upon the configuration, which routers will the LSP go through?

R1, R3, R2, R5, R4 and R6

R1, R2, R5 and R6

R1, R3, R4 and R6

R1, R2, R4 and R6

NEW QUESTION 25
Which of the following statements about segment routing fast re-route is FALSE?

Fast re-route is a temporary fix that becomes active for a short period of time after a local network failure.

Fast re-route typically protects the active segment of a tunnel, but under certain conditions it can protect an end-to-end multi-segment tunnel instead.

On a Nokia 7750 SR, R-LFA and TI-LFA can be enabled independently of each other.

The parameter “max-sr-frr-labels” limits the number of labels that R-LFA can add to the data packet encapsulation.

NEW QUESTION 26
The exhibit shows the fast re-route configuration on router R1, in which both R-LFA and TI-LFA have been enabled. Assume that there are multiple potential backup paths for a given prefix. Which of the following options will router R1 use?

A standard LFA path that would not coincide with the path after IGP re-convergence.

An R-LFA path that would not coincide with the path after IGP re-convergence.

A D-LFA path that would not coincide with the path after IGP re-convergence.

A D-LFA path that would coincide with the path after IGP re-convergence.

NEW QUESTION 27
Which of the following statements about a Segment Routing SID is FALSE?

A Node-SID is usually associated with a router’s system interface.

Adjacency-SID values are taken from the SRGB configured for the routing protocol.

A Prefix-SID can be configured directly as a label value or indirectly as an index.

An Adjacency-SID does not have to be configured.

NEW QUESTION 28
Which of the following statements about the operation of seamless-BFD is FALSE?

Seamless-BFD responses are sent back using the LSP label stack.

To be able to respond to seamless-BFD messages, a router must be configured as a reflector.

A seamless-BFD template needs to be configured on the head-end of the LSP.

The routing protocol (OSPF or IS-IS) is used to carry the reflector discriminator information.

NEW QUESTION 29
Which of the following is NOT a valid option to steer traffic into a flex-algo segment-routing tunnel?

Using a flex-algo Node-SID as an explicit hop in the path definition of an SR-TE LSP and enabling the sr-te tunnel type for a VPN service.

Specifying the flex-algo instance ID as an additional TE constraint for an SR-TE LSP and enabling the sr-te tunnel type for a VPN service.

Configuring and applying a VRF import policy to a VPRN service and enabling the sr-is-is or sr-ospf tunnel type for the service, depending on the underlying routing protocol.

Configuring and applying a VSI import policy to an EVPN service and enabling the sr-is-is or sr-ospf tunnel type for the service, depending on the underlying routing protocol.

NEW QUESTION 30
Loopfree-alternate has been enabled on a router for its link-state routing protocol. For which types of segments will the router attempt to find a backup path, so that they become protected by fast re-route?

Only segments defined by a Node-SID.

Only segments defined by an Adjacency-SID.

Segments defined by a Node-SID and segments defined by an Adjacency-SID.

No segments, unless segment-routing fast-reroute is also explicitly enabled.