A B C D E F G H I J K L M N O P Q R S T U V Z 

I

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.
initialize(NetPlan, ConnectionNetState, Map<String, String>, Map<String, String>) - Method in interface com.net2plan.interfaces.cacSimulation.ICACAlgorithm
 
initialize(NetPlan, ConnectionNetState, Map<String, String>, Map<String, String>) - Method in interface com.net2plan.interfaces.cacSimulation.IConnectionEventGenerator
 
initialize(NetPlan, FailureNetState, Map<String, String>, Map<String, String>) - Method in interface com.net2plan.interfaces.resilienceSimulation.IProvisioningAlgorithm
 
initialize(NetPlan, FailureNetState, Map<String, String>, Map<String, String>) - Method in interface com.net2plan.interfaces.resilienceSimulation.IResilienceEventGenerator
 
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 connection event generator can be run in the Connection simulator included within Net2Plan.
isBidirectional(NetPlan) - Static method in class com.net2plan.libraries.GraphUtils
Check whether the physical topology has the same number of links between each node pair in both directions (assuming multi-digraphs).
isBidirectional(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).
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(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(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).
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.
isInitializeEvent() - Method in class com.net2plan.interfaces.cacSimulation.ConnectionEvents
 
isInitializeEvent() - Method in class com.net2plan.interfaces.resilienceSimulation.ResilienceEvents
 
isLinkDown(int) - Method in class com.net2plan.interfaces.resilienceSimulation.FailureNetState
Checks whether the specified link is down.
isNodeDown(int) - Method in class com.net2plan.interfaces.resilienceSimulation.FailureNetState
Checks whether the specified node is down.
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(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(NetPlan, double[]) - Static method in class com.net2plan.libraries.GraphUtils
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.
isWeightedBidirectional(Graph) - Static method in class com.net2plan.libraries.GraphUtils.JGraphTUtils
Check whether the graph has the same number of links between each node pair in both directions (assuming multi-digraphs) and same weights per direction.
A B C D E F G H I J K L M N O P Q R S T U V Z