Flexible Algorithm Discovery and Visualization by a PCE

Flexible Algorithm enables networks to compute paths based on specific constraints and metrics, such as latency or administrative preferences. This test evaluates the ability of the Path Computation Element to discover and visualize the flexible algorithm definitions and their associated topology information in a multivendor environment.
The test steps include:

• Establishing a BGP-LS session between the PCE and the network device
• Visualizing the discovered topology and associated attributes on the PCE
  In one test iteration, the topology information was derived directly from IS-IS instead of BGP-LS.