Package | Description |
---|---|
com.net2plan.interfaces.cacSimulation |
Provides a set of classes and interfaces for the connection simulator tool.
|
com.net2plan.interfaces.networkDesign |
Provides a set of classes and interfaces for the network design tool.
|
com.net2plan.interfaces.resilienceSimulation |
Provides a set of classes and interfaces for the resilience simulator tool.
|
com.net2plan.libraries |
Provides a set of useful libraries to develop algorithms and reports.
|
Modifier and Type | Method and Description |
---|---|
NetPlan |
ConnectionNetState.convertToNetPlan()
Converts the current network state to a network plan.
|
Modifier and Type | Method and Description |
---|---|
Object |
ICACAlgorithm.initialize(NetPlan netPlan,
ConnectionNetState netState,
Map<String,String> algorithmParameters,
Map<String,String> net2planParameters) |
Object |
IConnectionEventGenerator.initialize(NetPlan netPlan,
ConnectionNetState netState,
Map<String,String> algorithmParameters,
Map<String,String> net2planParameters) |
ConnectionActions |
ICACAlgorithm.processEvent(NetPlan netPlan,
ConnectionNetState connectionNetState,
ConnectionEvents event,
Object internalState) |
ConnectionEvents |
IConnectionEventGenerator.processEvent(NetPlan netPlan,
ConnectionNetState connectionNetState,
ConnectionEvents event,
Object internalState) |
Constructor and Description |
---|
ConnectionNetState(NetPlan netPlan) |
Modifier and Type | Method and Description |
---|---|
NetPlan |
NetPlan.copy()
Returns a deep copy of the network design.
|
static NetPlan |
NetPlan.create()
Returns an empty network design.
|
NetPlan |
NetPlan.unmodifiableView()
Returns an unmodifiable view of the network design.
|
Modifier and Type | Method and Description |
---|---|
void |
NetPlan.addDemandsFrom(NetPlan demands) |
String |
IAlgorithm.executeAlgorithm(NetPlan netPlan,
Map<String,String> algorithmParameters,
Map<String,String> net2planParameters)
Execute the algorithm.
|
String |
IReport.executeReport(NetPlan netPlan,
Map<String,String> reportParameters,
Map<String,String> net2planParameters,
IWrapperManager wrapperManager)
Executes a report.
|
Modifier and Type | Method and Description |
---|---|
String |
IAlgorithmMultiLayer.executeAlgorithm(List<NetPlan> netPlans,
Map<String,String> algorithmParameters,
Map<String,String> net2planParameters)
Execute the algorithm.
|
Constructor and Description |
---|
NetPlan(NetPlan aux) |
Modifier and Type | Method and Description |
---|---|
NetPlan |
FailureNetState.convertToNetPlan()
Converts the current network state to a network plan.
|
Modifier and Type | Method and Description |
---|---|
ProvisioningActions |
IProvisioningAlgorithm.executeProvisioningAlgorithm(NetPlan netPlan,
FailureNetState netState,
ResilienceEvents event,
Object internalStateObject)
Executes the provisioning algorithm.
|
Object |
IProvisioningAlgorithm.initialize(NetPlan netPlan,
FailureNetState netState,
Map<String,String> algorithmParameters,
Map<String,String> net2planParameters) |
Object |
IResilienceEventGenerator.initialize(NetPlan netPlan,
FailureNetState netState,
Map<String,String> algorithmParameters,
Map<String,String> net2planParameters) |
ResilienceEvents |
IResilienceEventGenerator.processEvent(NetPlan netPlan,
FailureNetState netState,
ResilienceEvents event,
Object internalState) |
Constructor and Description |
---|
FailureNetState(NetPlan netPlan)
Initializes a network state structure.
|
Modifier and Type | Method and Description |
---|---|
static com.jom.DoubleMatrixND |
GraphUtils.computeDemand2PathAssignmentMatrix(NetPlan netPlan) |
static com.jom.DoubleMatrixND |
GraphUtils.computeLink2PathAssignmentMatrix(NetPlan netPlan) |
static Quadruple<int[][],int[][],double[],double[]> |
ResilienceUtils.generateFailureGroupsPerBidirectionalLinkBundle(NetPlan netPlan,
double defaultMTTF,
double defaultMTTR) |
static Quadruple<int[][],int[][],double[],double[]> |
ResilienceUtils.generateFailureGroupsPerDirectionalLinkBundle(NetPlan netPlan,
double defaultMTTF,
double defaultMTTR) |
static Quadruple<int[][],int[][],double[],double[]> |
ResilienceUtils.generateFailureGroupsPerLink(NetPlan netPlan,
double defaultMTTF,
double defaultMTTR) |
static Quadruple<int[][],int[][],double[],double[]> |
ResilienceUtils.generateFailureGroupsPerNode(NetPlan netPlan,
double defaultMTTF,
double defaultMTTR) |
static Pair<double[],double[]> |
ResilienceUtils.getAvailabilityValues(NetPlan netPlan,
int F,
double defaultMTTF,
double defaultMTTR) |
static org.jgrapht.Graph<Integer,Integer> |
GraphUtils.JGraphTUtils.getDemandLayerGraph(NetPlan netPlan)
Returns a graph representing the traffic demands (nodes and links) of the network plan.
|
static edu.uci.ics.jung.graph.Graph<Integer,Integer> |
GraphUtils.JUNGUtils.getDemandLayerGraph(NetPlan netPlan)
Returns a graph representing the traffic demands (nodes and links) of the network plan.
|
static int[] |
GraphUtils.getDemandPathVector(NetPlan netPlan)
Returns the demand-path vector (a 1xP vector in which an element d(p) is equal to the demand identifier for path p).
|
static Quadruple<int[][],int[][],double[],double[]> |
ResilienceUtils.getFailureGroupsFromNetPlan(NetPlan netPlan,
double defaultMTTF,
double defaultMTTR) |
static double[] |
IPUtils.getLinkWeightAttributes(NetPlan netPlan)
Obtains the set of link weights (link attribute 'linkWeight', default: 1) from a given a network design.
|
static com.jom.DoubleMatrixND |
GraphUtils.getNodeAdjacencyMatrix(NetPlan netPlan)
Returns the node adjacency matrix (a NxN matrix in which an element aij is equal to the number of links from node i to node j).
|
static com.jom.DoubleMatrixND |
GraphUtils.getNodeDemandIncidenceMatrix(NetPlan netPlan)
Returns the node-demand incidence matrix (a NxD matrix in which an element wnd is equal to 1 if node n is the ingress node of demand d, -1 if node n is the egress node of demand d, and zero otherwise).
|
static com.jom.DoubleMatrixND |
GraphUtils.getNodeLinkIncidenceMatrix(NetPlan netPlan)
Returns the node-link incidence matrix (a NxE matrix in which an element ane is equal to 1 if node n is the origin node of link e, -1 if node n is the destination node of link e, and zero otherwise).
|
static org.jgrapht.Graph<Integer,Integer> |
GraphUtils.JGraphTUtils.getPhysicalLayerGraph(NetPlan netPlan)
Returns a graph representing the physical topology (nodes and links) of the network plan.
|
static edu.uci.ics.jung.graph.Graph<Integer,Integer> |
GraphUtils.JUNGUtils.getPhysicalLayerGraph(NetPlan netPlan)
Returns a graph representing the physical topology (nodes and links) of the network plan.
|
static double[][] |
IPUtils.getRoutingTableMatrix(NetPlan netPlan)
Obtains a destination-based routing from a given network design.
|
static boolean |
GraphUtils.isBidirectional(NetPlan netPlan)
Check whether the physical topology has the same number of links between each node pair in both directions (assuming multi-digraphs).
|
static boolean |
GraphUtils.isConnected(NetPlan netPlan)
Check whether the physical topology is connected, that is, if it is possible to connect every node to each other.
|
static boolean |
GraphUtils.isConnected(NetPlan netPlan,
int[] nodes)
Check whether the physical topology is connected, that is, if it is possible to connect every node to each other, but only in a subset of nodes (subgraph).
|
static boolean |
GraphUtils.isSimple(NetPlan netPlan)
Check whether the physical topology is simple, that is, if it has at most one unidirectional link from a node to each other.
|
static boolean |
GraphUtils.isWeightedBidirectional(NetPlan netPlan,
double[] linkWeight)
Check whether the physical topology has the same number of links between each node pair in both directions (assuming multi-digraphs) and same weights per direction.
|
static void |
IPUtils.setLinkWeightAttributes(NetPlan netPlan,
double[] linkWeights)
Adds a 'linkWeight' attribute to each link with an associated link weight.
|
static void |
IPUtils.setRoutesFromRoutingTableMatrix(NetPlan netPlan,
double[][] f_te)
Generates routes from the demand set of a given a network design using a given set of routing tables.
|
Modifier and Type | Method and Description |
---|---|
static void |
MultiLayerUtils.checkLayerConsistency(List<NetPlan> netPlans)
Check for consistency between a list of hierarchical layers
|
Constructor and Description |
---|
CandidatePathList(NetPlan netPlan,
boolean useRoutesWithinNetPlan,
double[] weights,
String... paramValuePairs)
Initializes the candidate path list, computing all the paths for each
demand.
|
CandidatePathList(NetPlan netPlan,
boolean useRoutesWithinNetPlan,
String... paramValuePairs)
Initializes the candidate path list, computing all the paths for each
demand.
|
CandidatePathList(NetPlan netPlan,
double[] weights,
String... paramValuePairs)
Initializes the candidate path list, computing all the paths for each
demand.
|
CandidatePathList(NetPlan netPlan,
File f) |
CandidatePathList(NetPlan netPlan,
String... paramValuePairs)
Initializes the candidate path list, computing all the paths for each
demand.
|