See: Description
| Class | Description |
|---|---|
| CandidatePathList |
A candidate path list is an object containing a set of paths computed for
each demand in the network.
|
| FlexGridUtils |
Class implementing some static methods to assist in creating algorithms for
flex-grid networks.
|
| FlexGridUtils.ModulationFormat |
Class to define modulation formats.
|
| GraphTheoryMetrics |
Class to deal with graph-theory metrics computation.
|
| GraphUtils |
Auxiliary static methods to work with graphs.
|
| GraphUtils.GraphPath<E> |
Class to represent a path in a Graph.
|
| GraphUtils.JGraphTUtils |
Auxiliary class to work with the graph library JGraphT.
|
| GraphUtils.JUNGUtils |
Auxiliary class to work with the graph library JUNG.
|
| GraphUtils.SuurballeTarjanAlgorithm<V,E> |
Class to calculate the shortest link-disjoint path pair between two nodes
using Suurballe-Tarjan's algorithm.
|
| GraphUtils.YenAlgorithm<V,E> |
Class to calculate the (loopless) k-shortest paths between a node
pair using Yen's algorithm.
|
| IPUtils |
Class for destination-based routing (IP-like).
|
| NetworkPerformanceMetrics |
Class providing static methods to compute several performance
metrics using classical formulae (i.e.
|
| SRGUtils |
Provides a set of static methods which can be useful when dealing with network resilience.
|
| TrafficComputationEngine |
Class implementing different traffic metrics.
|
| TrafficMatrixGenerationModels |
Set of methods implementing different traffic generation models based on traffic matrices.
|
| WDMUtils |
Class to deal with optical topologies including wavelength assignment and regenerator placement.
|
| WDMUtils.WavelengthOccupancyTransformer |
Fiber-to-weight transformer for shortest path algorithms which returns
Double.MAX_VALUE for already-occupied fibers, and the associated
weight otherwise. |
| Enum | Description |
|---|---|
| SRGUtils.SharedRiskModel |
Type of shared-risk model.
|
| Exception | Description |
|---|---|
| GraphUtils.ClosedCycleRoutingException |
Exception thrown when hop-by-hop routing includes closed cycles.
|