Package org.opendaylight.algo.impl

Class Samcra

java.lang.Object

org.opendaylight.algo.impl.AbstractPathComputation

org.opendaylight.algo.impl.Samcra

All Implemented Interfaces:

PathComputationAlgorithm

public class Samcra
extends AbstractPathComputation

This Class implements the Self Adaptive Multiple Constraints Routing Algorithm (SAMCRA) a Path Computation Algorithm. The SAMCRA algorithm take into account the Bandwidth, TE Metric and Delay as composite constraints. Details of SAMCRA algorithm could be found in the article "Concepts of Exact QoS Routing Algorithms", Piet Van Mieghem and Fernando A. Kuipers, IEEE/ACM Transactions on Networking, Volume 12, Number 5, October 2004.

Author:

Philippe Niger, Olivier Dugeon, Philippe Cadro

Field Summary

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

constraints, graph, pathDestination, pathSource, priorityQueue, processedPath

Constructor Summary

Constructors

Constructor	Description
Samcra(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

Samcra

public Samcra(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)