Package org.opendaylight.algo

Interface PathComputationAlgorithm

All Known Implementing Classes:
AbstractPathComputation, ConstrainedShortestPathFirst, Samcra, ShortestPathFirst
public interface PathComputationAlgorithm
This class provides entry for various Path Computation Algorithms.
Author:
Olivier Dugeon

  • Method Details

    • computeP2pPath

      @NonNull ConstrainedPath computeP2pPath(VertexKey source, VertexKey destination, Constraints constraints)
      Compute Point to Point Path from source to destination taking into account constraints.
      Parameters:
      source - Source Vertex Key
      destination - Destination Vertex Key
      constraints - Constraints (Metric, TE Metric, Delay, Jitter, Loss, Bandwidth)
      Returns:
      A Path that meet constraints or empty path otherwise. ConstrainedPath.Status indicates the result of the path computation (Completed or Failed)

    • computeDivertPaths

      @NonNull ConstrainedPath computeDivertPaths(VertexKey source, VertexKey destination, Constraints constraints)
      Compute point to point divert path from source to destination taking into account specified constraints. The secondary path could use the same source / destination endpoints or a new endpoint pair could be specified within the diversity Object under the constraints.
      Parameters:
      source - Source Vertex Key
      destination - Destination Vertex Key
      constraints - Constraints including diversity (link, node, srlg and endpoints if different)
      Returns:
      Two diverted paths that meet constraints or empty paths otherwise. ConstrainedPath.Status indicates the result of the path computation (Completed or Failed). SecondaryPath contains the path description of the diverted path.