Uses of Interface
bcds.phison.ra.RoutingAlg

Packages that use RoutingAlg

bcds.phison.ra

The routing algorithm (ra) package defines the interface expected by the Phison simulator and implements several well-known routing algorithms, such as Dijkstra, WSP and SWP.

Uses of RoutingAlg in bcds.phison.ra

Classes in bcds.phison.ra that implement RoutingAlg

class	DijkstraAll<V,E> Implements a priority queue based Dijkstra algorithm for finding single-source all-destination shortest paths.
class	DijkstraMaxWidth<V,E> Finds a path between two nodes offering the maximum minimum "width", where the width is anything passed as a cost map.
class	LIOA<V,E> Implements the LIOA routing algorithm.
class	LMIR<V,E> Implements the LMIR routing algorithm as described in: Gustavo B.
class	MinHop<V,E> Implements Dijkstra-based min-hop routing.
class	Null<V,E> This is a "null" router: Everything is rejected, no matter what.
class	ProtDPP_MinCost<V,E> Provides Dedicated dath Protection (DPP) using DijkstraAll as the search algorithm.
class	SWP<V,E> Implements the SWP (Shortest Widest Path) routing algorithm.
class	WSP<V,E> Implements the WSP (Widest-Shortest Path) routing algorithm.

Fields in bcds.phison.ra declared as RoutingAlg

RoutingAlg<V,E>

ConnectionInfo.ra A reference to the routing algorithm that was used to find the paths for this connection.