Summer Special - 65% Discount Offer - Ends in 0d 00h 00m 00s - Coupon code: c4sdisc65

4A0-116 PDF

$38.5

$109.99

3 Months Free Update

  • Printable Format
  • Value of Money
  • 100% Pass Assurance
  • Verified Answers
  • Researched by Industry Experts
  • Based on Real Exams Scenarios
  • 100% Real Questions

4A0-116 PDF + Testing Engine

$61.6

$175.99

3 Months Free Update

  • Exam Name: Nokia Segment Routing Exam
  • Last Update: Jul 23, 2024
  • Questions and Answers: 40
  • Free Real Questions Demo
  • Recommended by Industry Experts
  • Best Economical Package
  • Immediate Access

4A0-116 Engine

$46.2

$131.99

3 Months Free Update

  • Best Testing Engine
  • One Click installation
  • Recommended by Teachers
  • Easy to use
  • 3 Modes of Learning
  • State of Art Technology
  • 100% Real Questions included

4A0-116 Practice Exam Questions with Answers Nokia Segment Routing Exam Certification

Question # 6

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

A.

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

B.

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

C.

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

D.

A stateful PCE can allow LSPs to reserve bandwidth.

Full Access
Question # 7

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

A.

A strict hop must be adjacent to the previous hop in the list.

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.

The head-end router may calculate a path that takes into account max hop count and bandwidth constraints.

Full Access
Question # 8

OSPF is being used for segment routing with traffic-engineering (SR-TE). The traffic-engineering option has been set to "sr-te false". Which of the following statements is TRUE?

A.

The TE information will be advertised for all the OSPF links that have MPLS enabled.

B.

The TE information will only be advertised using application-specific sub-TLVs.

C.

The TE information will only be advertised for the OSPF links that have both MPLS and RSVP enabled.

D.

The TE information will only be advertised using extended-link opaque LSAs.

Full Access
Question # 9

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 create cross-area TE-constrained LSP paths

B.

The ability to create LSP paths with bandwidth reservation

C.

The ability to create LSPs with primary and secondary paths

D.

The ability to ensure that some LSP paths are disjoint

Full Access
Question # 10

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

A.

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

B.

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

C.

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

D.

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

Full Access
Question # 11

A router participating in SR-TE is advertising a value of Ox11 for the admin-group membership of one of its interfaces. Which of the following statements is TRUE?

A.

The interface belongs to admin group RED, configured with a value of 17.

B.

The interface belongs to two different admin groups.

C.

The interface belongs to three different admin groups.

D.

The interface belongs to four different admin groups.

Full Access
Question # 12

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.

Full Access