- IAlgorithm - Interface in com.net2plan.interfaces.networkDesign
-
Contract that must be fulfilled such that an algorithm can be run in Net2Plan
.
- IAlgorithmMultiLayer - Interface in com.net2plan.interfaces.networkDesign
-
Contract that must be fulfilled such that an multilayer algorithm can be run in Net2Plan
.
- ICACAlgorithm - Interface in com.net2plan.interfaces.cacSimulation
-
Contract that must be fulfilled such that a call admission control algorithm can be run in the Connection simulator
included within Net2Plan
.
- IConnectionEventGenerator - Interface in com.net2plan.interfaces.cacSimulation
-
Contract that must be fulfilled such that a connection event generator can be run in the Connection simulator
included within Net2Plan
.
- includeNet2PlanHeader(String) - Static method in class com.net2plan.utils.HTMLUtils
-
Includes a Net2Plan header to a HTML string.
- initialize(NetPlan, ConnectionNetState, Map<String, String>, Map<String, String>) - Method in interface com.net2plan.interfaces.cacSimulation.ICACAlgorithm
-
Initializes the CAC algorithm (i.e. reading input parameters).
- initialize(NetPlan, ConnectionNetState, Map<String, String>, Map<String, String>) - Method in interface com.net2plan.interfaces.cacSimulation.IConnectionEventGenerator
-
Initializes the connection generator (i.e. reading input parameters)
- initialize(NetPlan, ResilienceNetState, Map<String, String>, Map<String, String>) - Method in interface com.net2plan.interfaces.resilienceSimulation.IProvisioningAlgorithm
-
Initializes the provisioning algorithm (i.e. reading input parameters).
- initialize(NetPlan, ResilienceNetState, Map<String, String>, Map<String, String>) - Method in interface com.net2plan.interfaces.resilienceSimulation.IResilienceEventGenerator
-
Initializes the event algorithm (i.e. reading input parameters).
- initialize(NetPlan, TimeVaryingNetState, Map<String, String>, Map<String, String>) - Method in interface com.net2plan.interfaces.timeVaryingTrafficSimulation.ITrafficAllocationAlgorithm
-
Initializes the allocation algorithm (i.e. reading input parameters).
- initialize(NetPlan, Map<String, String>, Map<String, String>) - Method in interface com.net2plan.interfaces.timeVaryingTrafficSimulation.ITrafficGenerator
-
Initializes the traffic generator (i.e. reading input parameters)
- intersect(double[]...) - Static method in class com.net2plan.utils.DoubleUtils
-
Returns the intersection vector of a series of input arrays.
- intersect(int[]...) - Static method in class com.net2plan.utils.IntUtils
-
Returns the intersection vector of a series of input arrays.
- IntUtils - Class in com.net2plan.utils
-
Provides extra functionality for int
primitives.
- IntUtils() - Constructor for class com.net2plan.utils.IntUtils
-
- inverseErlangB(double, double) - Static method in class com.net2plan.libraries.NetworkPerformanceMetrics
-
Returns the number of servers (i.e. link capacity) to achieve a given grade of service (i.e. call blocking probability) under a given load in a M/M/n/n
queue system using the efficient implementation presented in [1].
- IProvisioningAlgorithm - Interface in com.net2plan.interfaces.resilienceSimulation
-
Contract that must be fulfilled such that a provisioning algorithm can be run in Net2Plan
.
- IPUtils - Class in com.net2plan.libraries
-
Class for destination-based routing (IP-like).
- IPUtils() - Constructor for class com.net2plan.libraries.IPUtils
-
- IReport - Interface in com.net2plan.interfaces.networkDesign
-
Contract that must be fulfilled such that a report can be run in Net2Plan
.
- IResilienceEventGenerator - Interface in com.net2plan.interfaces.resilienceSimulation
-
Contract that must be fulfilled such that a failure/reparation event generator can be run in the Connection simulator
included within Net2Plan
.
- isActiveConnection(long) - Method in class com.net2plan.interfaces.cacSimulation.ConnectionNetState
-
Returns true
if the given connection is active.
- isActiveConnectionRoute(long) - Method in class com.net2plan.interfaces.cacSimulation.ConnectionNetState
-
Returns true
if the given connection route is active.
- isBidirectional(NetPlan) - Static method in class com.net2plan.libraries.GraphUtils
-
Checks whether the physical topology has the same number of links between each node pair in both directions (assuming multi-digraphs).
- isBidirectional(int[][], int) - Static method in class com.net2plan.libraries.GraphUtils
-
Checks whether the physical topology has the same number of links between each node pair in both directions (assuming multi-digraphs).
- isBidirectional(org.jgrapht.Graph) - Static method in class com.net2plan.libraries.GraphUtils.JGraphTUtils
-
Check whether the topology has the same number of links between each node pair in both directions (assuming multi-digraphs).
- isBottleneckLink(int) - Method in class com.net2plan.libraries.NetworkPerformanceMetrics
-
Returns true
if the link is a bottleneck (i.e. it has the maximum
utilization among all links), otherwise false
.
- isConnected(NetPlan) - Static method in class com.net2plan.libraries.GraphUtils
-
Check whether the physical topology is connected, that is, if it is possible to connect every node to each other.
- isConnected(NetPlan, int[]) - Static method in class com.net2plan.libraries.GraphUtils
-
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).
- isConnected(org.jgrapht.Graph) - Static method in class com.net2plan.libraries.GraphUtils.JGraphTUtils
-
Check whether the graph is connected, that is, if it is possible to connect every node to each other.
- isConnected(org.jgrapht.Graph, Set) - Static method in class com.net2plan.libraries.GraphUtils.JGraphTUtils
-
Check whether the graph is connected, that is, if it is possible to connect every node to each other, but only in a subset of vertices (subgraph).
- isEmpty() - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Returns true
if the network is empty (no nodes/links/demands...).
- isEqualWithinAbsoluteTolerance(double, double, double) - Static method in class com.net2plan.utils.DoubleUtils
-
Checks if a given value is within a tolerance margin compared to a given pattern.
- isEqualWithinRelativeTolerance(double, double, double) - Static method in class com.net2plan.utils.DoubleUtils
-
Checks if the relative difference between a given value and a pattern is within a tolerance margin.
- isRoutePartialRecoveryAllowed(long) - Method in class com.net2plan.interfaces.resilienceSimulation.ResilienceNetState
-
Indicates whether or not a given route allows partial recovery (default, true
).
- isRouteRevertible(long) - Method in class com.net2plan.interfaces.resilienceSimulation.ResilienceNetState
-
Indicates whether or not a given route is revertible (default, true
).
- isRoutingBifurcated() - Method in class com.net2plan.libraries.NetworkPerformanceMetrics
-
Returns true
if the routing is bifurcated, otherwise false
.
- isSimple(NetPlan) - Static method in class com.net2plan.libraries.GraphUtils
-
Check whether the physical topology is simple, that is, if it has at most one unidirectional link from a node to each other.
- isSimple(org.jgrapht.Graph) - Static method in class com.net2plan.libraries.GraphUtils.JGraphTUtils
-
Check whether the graph is simple, that is, if it has at most one link between each node pair (one per direction under directed graphs, one under undirected graphs).
- isWeightedBidirectional(int[][], double[], int) - Static method in class com.net2plan.libraries.GraphUtils
-
Checks 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.
- isWeightedBidirectional(NetPlan, double[]) - Static method in class com.net2plan.libraries.GraphUtils
-
Checks 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.
- isWeightedBidirectional(org.jgrapht.Graph) - Static method in class com.net2plan.libraries.GraphUtils.JGraphTUtils
-
Checks whether the graph has the same number of links between each node pair in both directions (assuming multi-digraphs) and same individual weights per direction.
- ITrafficAllocationAlgorithm - Interface in com.net2plan.interfaces.timeVaryingTrafficSimulation
-
Contract that must be fulfilled such that a traffic allocation algorithm can be
run in Net2Plan
.
- ITrafficGenerator - Interface in com.net2plan.interfaces.timeVaryingTrafficSimulation
-
Contract that must be fulfilled such that a traffic generator can be run
in the Time-varying traffic simulator
included within Net2Plan
.