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.interfaces.timeVaryingTrafficSimulation |
Provides a set of classes and interfaces for the time-varying traffic 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 |
---|---|
void |
ICACAlgorithm.initialize(NetPlan netPlan,
ConnectionNetState netState,
Map<String,String> algorithmParameters,
Map<String,String> net2planParameters)
Initializes the CAC algorithm (i.e. reading input parameters).
|
List<CACEvent> |
IConnectionEventGenerator.initialize(NetPlan netPlan,
ConnectionNetState netState,
Map<String,String> algorithmParameters,
Map<String,String> net2planParameters)
Initializes the connection generator (i.e. reading input parameters)
|
List<CACAction> |
ICACAlgorithm.processEvent(NetPlan netPlan,
ConnectionNetState netState,
CACEvent event)
Processes a new event.
|
List<CACEvent> |
IConnectionEventGenerator.processEvent(NetPlan netPlan,
ConnectionNetState netState,
CACEvent event)
Processes a new event.
|
Constructor and Description |
---|
ConnectionNetState(NetPlan netPlan)
Default constructor.
|
Modifier and Type | Method and Description |
---|---|
NetPlan |
NetPlan.copy()
Returns a deep copy of the network design.
|
NetPlan |
NetPlan.unmodifiableView()
Returns an unmodifiable view of the network design.
|
Modifier and Type | Method and Description |
---|---|
void |
NetPlan.addDemandsFrom(NetPlan demands)
Adds to the current network plan the traffic demand set from other network plan.
|
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)
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.
|
Modifier and Type | Method and Description |
---|---|
NetPlan |
ResilienceNetState.convertToNetPlan()
Converts the current network state to a network plan.
|
Modifier and Type | Method and Description |
---|---|
void |
IProvisioningAlgorithm.initialize(NetPlan netPlan,
ResilienceNetState netState,
Map<String,String> algorithmParameters,
Map<String,String> net2planParameters)
Initializes the provisioning algorithm (i.e. reading input parameters).
|
List<ResilienceEvent> |
IResilienceEventGenerator.initialize(NetPlan netPlan,
ResilienceNetState netState,
Map<String,String> algorithmParameters,
Map<String,String> net2planParameters)
Initializes the event algorithm (i.e. reading input parameters).
|
List<ProvisioningAction> |
IProvisioningAlgorithm.processEvent(NetPlan netPlan,
ResilienceNetState netState,
ResilienceEvent event)
Executes the provisioning algorithm.
|
List<ResilienceEvent> |
IResilienceEventGenerator.processEvent(NetPlan netPlan,
ResilienceNetState netState,
ResilienceEvent event)
Executes the event generator.
|
Constructor and Description |
---|
ResilienceNetState(NetPlan netPlan)
Default constructor.
|
Modifier and Type | Method and Description |
---|---|
double[] |
ITrafficGenerator.execute(NetPlan netPlan,
Calendar currentDate)
Processes a new event.
|
void |
ITrafficAllocationAlgorithm.initialize(NetPlan netPlan,
Map<String,String> algorithmParameters,
Map<String,String> net2planParameters)
Initializes the allocation algorithm (i.e. reading input parameters).
|
void |
ITrafficGenerator.initialize(NetPlan netPlan,
Map<String,String> algorithmParameters,
Map<String,String> net2planParameters)
Initializes the traffic generator (i.e. reading input parameters)
|
List<TrafficAllocationAction> |
ITrafficAllocationAlgorithm.processEvent(NetPlan netPlan,
double[] h_d,
Calendar calendar)
Processes a new event.
|
Modifier and Type | Method and Description |
---|---|
static void |
WDMUtils.checkConsistency(NetPlan physicalLayer)
Performs extra checks to those applicable to every network design, especially
focused on WDM networks.
|
static com.jom.DoubleMatrixND |
GraphUtils.computeDemand2PathAssignmentMatrix(NetPlan netPlan)
Returns the demand-path incidence matrix (a DxP matrix in which an element δdp is equal to 1 if traffic route p is able to carry traffic from demand d).
|
static com.jom.DoubleMatrixND |
GraphUtils.computeLink2PathAssignmentMatrix(NetPlan netPlan)
Returns the link-path incidence matrix (an ExP matrix in which an element δep is equal to the number of times which traffic route p traverses link e).
|
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 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 int[] |
WDMUtils.getRegeneratorOccupancy(NetPlan physicalLayer)
Returns the number of regenerators installed per node.
|
static double[][] |
IPUtils.getRoutingTableMatrix(NetPlan netPlan)
Obtains a destination-based routing from a given network design.
|
static List<Set<Integer>> |
WDMUtils.getWavelengthOccupancy(NetPlan physicalLayer)
Returns the set of used wavelengths per fiber.
|
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 linkWeight)
Adds a 'linkWeight' attribute to each link with an associated link weight.
|
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)
Initializes the candidate path list, previously stored in a system file.
|
CandidatePathList(NetPlan netPlan,
String... paramValuePairs)
Initializes the candidate path list, computing all the paths for each
demand.
|
NetworkPerformanceMetrics(NetPlan netPlan,
Map<String,String> net2planParameters,
String... paramValuePairs)
Default constructor.
|