Package 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.

See:
Description

Interface Summary

RoutingAlg<V,E>

Defines the methods that all routing algorithms must implement.

Class Summary

ConnectionInfo<V,E>	Holds information about a connection, such as its working and backup path (if any), a reference to the routing algorithm used to allocate capacity, the source and destination, among others.
DijkstraAll<V,E>	Implements a priority queue based Dijkstra algorithm for finding single-source all-destination shortest paths.
DijkstraMaxWidth<V,E>	Finds a path between two nodes offering the maximum minimum "width", where the width is anything passed as a cost map.
LIOA<V,E>	Implements the LIOA routing algorithm.
LMIR<V,E>	Implements the LMIR routing algorithm as described in: Gustavo B.
MinHop<V,E>	Implements Dijkstra-based min-hop routing.
Null<V,E>	This is a "null" router: Everything is rejected, no matter what.
ProtDPP_MinCost<V,E>	Provides Dedicated dath Protection (DPP) using DijkstraAll as the search algorithm.
ProtectionAlgBase<V,E>	Provides common functions and data structures for protection-aware routing algorithms.
RoutingAlgBase<V,E>	Provides default implementation of the methods defined in RoutingAlg as well as additional methods useful for routing algorithms.
SWP<V,E>	Implements the SWP (Shortest Widest Path) routing algorithm.
TED<V,E>	Implements a minimal "traffic engineering database" for path-oriented networks/routing.
WSP<V,E>	Implements the WSP (Widest-Shortest Path) routing algorithm.

Enum Summary

Disjoinness

Defines the types of disjoinness usually required for primary and backup paths under protection-aware routing algorithms.

Package bcds.phison.ra Description

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.