Package org.opendaylight.algo.impl

Class ConstrainedShortestPathFirst

java.lang.Object

org.opendaylight.algo.impl.AbstractPathComputation

org.opendaylight.algo.impl.ConstrainedShortestPathFirst

All Implemented Interfaces:

PathComputationAlgorithm

public class ConstrainedShortestPathFirst
extends AbstractPathComputation

This Class implements a simple Constrained Shortest Path First path computation algorithm that take into account Bandwidth and TE Metric as constraints.

Author:

Olivier Dugeon, Philippe Niger, Philippe Cadro

Field Summary

Fields inherited from class org.opendaylight.algo.impl.AbstractPathComputation

constraints, graph, pathDestination, pathSource, priorityQueue, processedPath

Constructor Summary

Constructors

Constructor	Description
ConstrainedShortestPathFirst(ConnectedGraph graph)

Method Summary

Modifier and Type	Method	Description
ConstrainedPath	computeP2pPath(VertexKey src, VertexKey dst, PathConstraints cts)	Compute Point to Point Path from source to destination taking into account constraints.

Methods inherited from class org.opendaylight.algo.impl.AbstractPathComputation

getIpv4NodeSid, getIpv6NodeSid, getPathDescription, initializePathComputation, pruneEdge

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

ConstrainedShortestPathFirst

public ConstrainedShortestPathFirst(ConnectedGraph graph)

Method Detail

computeP2pPath

public ConstrainedPath computeP2pPath(VertexKey src,
                                      VertexKey dst,
                                      PathConstraints cts)

Description copied from interface: PathComputationAlgorithm

Compute Point to Point Path from source to destination taking into account constraints.

Specified by:

computeP2pPath in interface PathComputationAlgorithm

Specified by:

computeP2pPath in class AbstractPathComputation

Parameters:

src - Source Vertex Key

dst - Destination Vertex Key

cts - 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)