Uses of Package
bcds.phison.ra

Packages that use bcds.phison.ra

bcds.phison.alg	This package contains implementations of basic graph algorithms, for example, for finding connected components, and minimum max-flows between node pairs.
bcds.phison.gm	Classes in this package extract measurable properties of a graph, its nodes or links.
bcds.phison.io	Classes in this package deal with reading or writing files (topologies in different formats, demand type defintions, zone maps, etc.).
bcds.phison.multfailures
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.
bcds.phison.sim	This package comprises the simulator and several processing modules.

Classes in bcds.phison.ra used by bcds.phison.alg

RoutingAlgBase
Provides default implementation of the methods defined in RoutingAlg as well as additional methods useful for routing algorithms.

TED
Implements a minimal "traffic engineering database" for path-oriented networks/routing.

Classes in bcds.phison.ra used by bcds.phison.gm

RoutingAlgBase
Provides default implementation of the methods defined in RoutingAlg as well as additional methods useful for routing algorithms.

TED
Implements a minimal "traffic engineering database" for path-oriented networks/routing.

Classes in bcds.phison.ra used by bcds.phison.io

TED
Implements a minimal "traffic engineering database" for path-oriented networks/routing.

Classes in bcds.phison.ra used by bcds.phison.multfailures

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

TED
Implements a minimal "traffic engineering database" for path-oriented networks/routing.

Classes in bcds.phison.ra used by bcds.phison.ra

ConnectionInfo
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
Implements a priority queue based Dijkstra algorithm for finding single-source all-destination shortest paths.

DijkstraAll.PathExpansionInfo
Used by DijkstraAll.evalEdge(E) to store and return the information gathered during the evaluation of the shortest path expanded by the (tentative) inclusion of a given link.

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

ProtectionAlgBase
Provides common functions and data structures for protection-aware routing algorithms.

RoutingAlg
Defines the methods that all routing algorithms must implement.

RoutingAlgBase
Provides default implementation of the methods defined in RoutingAlg as well as additional methods useful for routing algorithms.

TED
Implements a minimal "traffic engineering database" for path-oriented networks/routing.

Classes in bcds.phison.ra used by bcds.phison.sim

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

TED
Implements a minimal "traffic engineering database" for path-oriented networks/routing.