Latest 4A0-116 exam dumps with real Nokia questions and answers [Q11-Q31]

Share

Latest 4A0-116 exam dumps with real Nokia questions and answers

4A0-116 Exam in First Attempt Guaranteed


Nokia 4A0-116 Exam Syllabus Topics:

TopicDetails
Topic 1
  • Configuring segment routing LSPs with traffic engineering constraints
  • Configuring IS-IS to advertise TE information
Topic 2
  • Link-state routing protocol extensions to support traffic engineering
  • Configuring OSPF to advertise TE information
Topic 3
  • Link-state routing protocol extensions to support segment routing
  • Configuring OSPF to support segment routing
Topic 4
  • Segment routing tunnels with traffic engineering constraints
  • Enabling traffic engineering
Topic 5
  • Precedence of the different LFA options
  • Enabling segment routing fast re-route
  • Path Computation Element Protocol (PCEP)
Topic 6
  • Differences between segment routing and other traditional MPLS label signaling protocols
  • MPLS data encapsulation and forwarding
Topic 7
  • Local calculation of a TE-constrained LSP path
  • Secondary LSP paths and seamless-BFD
  • Ensuring LSP path diversity
Topic 8
  • Topology-Independent Loop-Free Alternate (TI-LFA) paths
  • Remote Loop-Free Alternate (R-LFA) paths

 

NEW QUESTION 11
In which of the following aspects does the configuration of flex-algo LSPs have an advantage over the configuration of SR-TE LSPs?

  • A. Label stack size of the encapsulated data packets
  • B. List of traffic-engineering constraint types available to choose from
  • C. Flexibility of configuring each LSP with its own set of traffic-engineering constraints
  • D. Ability to associate one primary and up to two secondary paths to the same LSP

Answer: C

Explanation:
Flex-Algo LSPs are a type of LSP that allows for greater flexibility in configuring traffic engineering constraints. This is because flex-algo LSPs can be configured with a unique set of traffic engineering constraints for each LSP, whereas SR-TE LSPs use a predefined set of traffic engineering constraints that applies to all LSPs.
Label stack size of the encapsulated data packets, List of traffic-engineering constraint types available to choose from, and Ability to associate one primary and up to two secondary paths to the same LSP are not the advantages of flex-algo LSPs over SR-TE LSPs.

 

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

  • A. Fast re-route is a temporary fix that becomes active for a short period of time after a local network failure.
  • B. 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.
  • C. The parameter "max-sr-frr-labels" limits the number of labels that R-LFA can add to the data packet encapsulation.
  • D. On a Nokia 7750 SR, R-LFA and TI-LFA can be enabled independently of each other.

Answer: D

Explanation:
On a Nokia 7750 SR, R-LFA and TI-LFA cannot be enabled independently; they must be enabled together. The parameter "max-sr-frr-labels" limits the number of labels that R-LFA can add to the data packet encapsulation.

 

NEW QUESTION 13
Examine the exhibit.

An LSP is being configured to start at R1 and end at R6 using local CSPF. The LSP has the following constraints. Include admin-group GREEN, use the TE metric and hop-limit 3. What routers will be included in the LSP path?

  • A. R1, R2, R4, R6
  • B. R1, R3, R5, R6
  • C. R1, R5, R6
  • D. R1, R6

Answer: B

 

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

  • A. A stateful PCE can allow LSPs to reserve bandwidth.
  • B. The PCE can obtain topology and traffic-engineering information from the network using either a link-state IGP or BGP-LS.
  • C. A stateless PCE can calculate cross-area traffic-engineering-constrained LSP paths.
  • D. A stateful PCE proactively monitors all the existing LSPs and triggers the necessary repairs and re-optimizations.

Answer: A

Explanation:
Stateful PCE can monitor the existing LSPs and trigger necessary repairs and re-optimizations, but it does not have the capability to reserve bandwidth.

 

NEW QUESTION 15
Which of the following statements about SR-TE administrative constraints is FALSE?

  • A. The head-end router may calculate a path that takes into account max hop count and bandwidth constraints.
  • B. The TE metric for a link is by default the same as the IGP metric.
  • C. Shared-Risk-Link Groups are only taken into account when calculating the secondary path.
  • D. A strict hop must be adjacent to the previous hop in the list.

Answer: C

Explanation:
Shared-Risk-Link Groups(SRLG) is taken into account when calculating both primary and secondary path to avoid routing over the same physical link.

 

NEW QUESTION 16
Which of the following statements about Segment Routing is FALSE?

  • A. No path signaling is required to establish an SR tunnel.
  • B. A link-state IGP is required to distribute SID information.
  • C. Intermediate routers do not maintain any tunnel informal
  • D. For TE-constrained tunnels, each data packet typically carries a single MPLS label to specify the tunnel path.

Answer: C

Explanation:
Intermediate routers do not maintain any tunnel informal: this statement is false, Intermediate routers do maintain tunnel information, such as the Forwarding Information Base (FIB) to forward the packets according to the path specified in the packets.

 

NEW QUESTION 17
For any of the LFA methods to work properly, there must be a router in the backup path that will forward traffic addressed to the destination without sending it back to the source. Which of the following statements describes the way R-LFA selects such a router?

  • A. It selects a remote router, reachable through a tunnel defined by a Node-SID and one or two Adjacency-SIDs.
  • B. It selects a remote router, reachable through a tunnel defined by a single Node-SID.
  • C. It can select an immediate neighbor or a remote router, as long as the backup path coincides with the path that will become active after IGP reconvergence.
  • D. It selects an immediate neighbor.

Answer: C

Explanation:
R-LFA (Remote Loop-Free Alternate) is a method that can select either an immediate neighbor or a remote router to be used as a backup next hop, as long as the backup path coincides with the path that will become active after IGP reconvergence.

 

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

  • A. R1, R3, R4 and R6
  • B. R1, R2, R4 and R6
  • C. R1, R3, R2, R5, R4 and R6
  • D. R1, R2, R5 and R6

Answer: A

 

NEW QUESTION 19
The exhibit highlights in blue the primary path of a segment going from router S to router D.
The exhibit also shows a backup path. The protected link fails and fast re-route is triggered on router S. If the backup path has been calculated using standard LFA, how many SIDs are included in the label stack of the data packet forwarded to router R1?

  • A. 0
  • B. 1
  • C. 2
  • D. 3

Answer: B

 

NEW QUESTION 20
An SR-TE LSP with a path definition that includes router R4 as a loose hop and for which Seamless-BFD has been enabled is following the path shown in the exhibit. What happens after router R4 fails if the routers along the path follow the default behavior?

  • A. The head end will periodically try to calculate a new path at a rate defined by the resignal timer.
  • B. The head end will periodically try to calculate a new path at a rate defined by the retry timer.
  • C. The head end will continue forwarding traffic to the current next-hop indefinitely, which will be discarded at the point of failure.
  • D. The head end will continue forwarding traffic to the current next-hop indefinitely, and R2 will redirect the traffic to R3 after IGP reconvergence.

Answer: C

Explanation:
When an SR-TE LSP with Seamless-BFD enabled, the BFD sessions are established between the routers along the path to detect any failures quickly. If a failure happens in the path, the router will stop forwarding the traffic and send a BFD control packet to the head-end router. In this case, R4 failed, BFD sessions will detect the failure and send a message to the head-end router, but since R4 is a loose hop, the path doesn't have to be re-calculate. The head-end router will continue forwarding traffic to the current next-hop, R2, which will be discarded at the point of failure (R4) as it doesn't know about the failure. And the traffic will not be redirected to R3 after IGP reconvergence.

 

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

  • A. Administrative groups that each link belongs to, TE metric of links, bandwidth availability of each link, SRLG that each link belongs to.
  • B. Administrative groups that each link belongs to, TE metric of links, SRLG that each link belongs to.
  • C. 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.
  • D. Administrative groups that each link belongs to, TE metric of links, SRLG that each link belongs to, link status up/down.

Answer: A

Explanation:
In SR-TE, routers need to advertise certain attributes of their links to other routers in the network in order to calculate traffic-engineered paths. These attributes include:
Administrative groups that each link belongs to: This information is used to restrict the use of certain links to specific traffic types or groups.
TE metric of links: This information is used to calculate the cost of using a particular link for a traffic-engineered path.
Bandwidth availability of each link: This information is used to control the amount of traffic that can be sent over a particular link.
SRLG that each link belongs to: This information is used to avoid routing over the same physical link. Link status up/down is not needed to be advertised as it is part of the IGP protocol and is used to check the reachability of a link.

 

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?

  • A. The ability to ensure that some LSP paths are disjoint
  • B. The ability to create LSP paths with bandwidth reservation
  • C. The ability to create cross-area TE-constrained LSP paths
  • D. The ability to create LSPs with primary and secondary paths

Answer: B

Explanation:
PCE does not have the capability to reserve bandwidth, This is a function of a Resource Reservation Protocol (RSVP) or a Label Distribution Protocol (LDP) and is done locally on the PE.
PCE can have advantages such as:
The ability to create cross-area TE-constrained LSP paths
The ability to create LSPs with primary and secondary paths
The ability to ensure that some LSP paths are disjoint
it can be used to optimize the path computation by centralizing the path calculation and by taking into account a global view of the network.

 

NEW QUESTION 23
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?

  • A. Establishing IGP adjacencies with routers R1 and R2
  • B. Establishing an IGP adjacency with router R2
  • C. Establishing a BGP session using the BGP-LS address family with router R3
  • D. Establishing BGP sessions using the BGP-LS address family with routers R3 and R4

Answer: D

 

NEW QUESTION 24
In the context of a network that includes a Path Computation Element (PCE), what is a PCC-initiated LSP?

  • A. An LSP for which the path repairs and re-optimizations must be triggered by the head-end router.
  • B. An LSP that needs to be explicitly configured on the head-end router.
  • C. An LSP whose existence and state are reported to the PCE.
  • D. An LSP for which the initial path is calculated by the head-end router.

Answer: C

Explanation:
A PCC-initiated LSP is an LSP that is established and controlled by the PCC (Path Computation Client) which is typically a head-end router. The PCC sends LSP setup and teardown requests to the PCE and also reports the existence and state of the LSPs to the PCE. The PCE then uses this information to perform path computation and to monitor the state of the LSPs.

 

NEW QUESTION 25
Based on the exhibit, which of the following statements about fast re-route for flex-algo instance 129 is TRUE?

  • A. Only standard LFA is enabled on router R1; fast re-route is not enabled on router R2.
  • B. Standard LFA and remote-LFA are enabled on router R1; standard LFA and TT-LFA are enabled on router R2.
  • C. Only standard LFA is enabled on both routers R1 and R2.
  • D. Standard LFA and remote-LFA are enabled on router R1; fast re-route is not enabled on router R2.

Answer: D

 

NEW QUESTION 26
Based on the configuration shown for routers R1 and R10, what valid flex-algo definitions exist in the network?

  • A. Two valid flex-algo definitions, one uses te-metric as the link metric and includes blue links and the other uses delay as the link met includes green links.
  • B. No valid flex-algo definitions, because of the conflicting parameters.
  • C. One valid flex-algo definition, using delay as the link metric and including green links.
  • D. One valid flex-algo definition, using te-metric as the link metric and including blue links.

Answer: A

 

NEW QUESTION 27
......

Exam Sure Pass Nokia Certification with 4A0-116 exam questions: https://vcetorrent.passreview.com/4A0-116-exam-questions.html