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

C

CandidatePathList - Class in com.net2plan.libraries
A candidate path list is an object containing a set of paths computed for each demand in the network.
CandidatePathList(NetPlan, File) - Constructor for class com.net2plan.libraries.CandidatePathList
 
CandidatePathList(NetPlan, String...) - Constructor for class com.net2plan.libraries.CandidatePathList
Initializes the candidate path list, computing all the paths for each demand.
CandidatePathList(NetPlan, double[], String...) - Constructor for class com.net2plan.libraries.CandidatePathList
Initializes the candidate path list, computing all the paths for each demand.
CandidatePathList(NetPlan, boolean, String...) - Constructor for class com.net2plan.libraries.CandidatePathList
Initializes the candidate path list, computing all the paths for each demand.
CandidatePathList(NetPlan, boolean, double[], String...) - Constructor for class com.net2plan.libraries.CandidatePathList
Initializes the candidate path list, computing all the paths for each demand.
check() - Static method in class com.net2plan.interfaces.networkDesign.Configuration
 
check(Map<String, String>) - Method in class com.net2plan.interfaces.resilienceSimulation.FailureNetState
Checks the current network state.
checkLayerConsistency(List<NetPlan>) - Static method in class com.net2plan.libraries.MultiLayerUtils
Check for consistency between a list of hierarchical layers
checkProtectionSegmentMergeabilityToRoute(int, int) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
Tests whether a given protection segment is applicable to a route.
checkRouteContinuity(int[]) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
 
checkRouteValidityForDemand(int[], int) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
 
checkRouting_fte(int[][], double[][]) - Static method in class com.net2plan.libraries.GraphUtils
This function checks the validity of a destination-based routing (i.e IP routing).
checkValidity(boolean) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
 
com.net2plan.interfaces.cacSimulation - package com.net2plan.interfaces.cacSimulation
Provides a set of classes and interfaces for the connection simulator tool.
com.net2plan.interfaces.networkDesign - package com.net2plan.interfaces.networkDesign
Provides a set of classes and interfaces for the network design tool.
com.net2plan.interfaces.resilienceSimulation - package com.net2plan.interfaces.resilienceSimulation
Provides a set of classes and interfaces for the resilience simulator tool.
com.net2plan.libraries - package com.net2plan.libraries
Provides a set of useful libraries to develop algorithms and reports.
com.net2plan.utils - package com.net2plan.utils
General utility static methods.
compareTo(GraphUtils.JUNGUtils.GraphPath) - Method in class com.net2plan.libraries.GraphUtils.JUNGUtils.GraphPath
 
computeAvailability(double[], double[]) - Static method in class com.net2plan.libraries.ResilienceUtils
Computes the availability of a series of network elements given the mean time to fail (MTTF) and the mean time to repair (MTTR).
computeDemand2PathAssignmentMatrix() - Method in class com.net2plan.libraries.CandidatePathList
 
computeDemand2PathAssignmentMatrix(NetPlan) - Static method in class com.net2plan.libraries.GraphUtils
 
computeECMPRoutingTableMatrix(int[][], double[], int) - Static method in class com.net2plan.libraries.IPUtils
Computes the routing tables for ECMP (Equal-Cost Multi-Path) using an OSPF-like (or IS-IS) mechanism, given a set of link weights.
computeLink2PathAssignmentMatrix() - Method in class com.net2plan.libraries.CandidatePathList
 
computeLink2PathAssignmentMatrix(List<int[]>, int) - Static method in class com.net2plan.libraries.GraphUtils
 
computeLink2PathAssignmentMatrix(NetPlan) - Static method in class com.net2plan.libraries.GraphUtils
 
computeOMPRoutingTableMatrix(int[][], double[], int) - Static method in class com.net2plan.libraries.IPUtils
Computes the optimal routing tables using an OSPF-OMP-like mechanism, given a set of link weights.
computePathsPerLinkSublist(int[]) - Method in class com.net2plan.libraries.CandidatePathList
For the set of paths provided, computes the map which provides for each link, the paths traversing the link
computeShortestPathsForDemand(int, double[]) - Method in class com.net2plan.libraries.CandidatePathList
 
computeSpWeightPerDemand(double[]) - Method in class com.net2plan.libraries.CandidatePathList
 
computeTrafficCarriedPerDemand(double[]) - Method in class com.net2plan.libraries.CandidatePathList
Computes the amount of traffic carried for each demand, if each path carries the traffic given in x_p vector
computeTrafficInEachLink(double[]) - Method in class com.net2plan.libraries.CandidatePathList
Computes the amount of traffic in each link, if each path carries the traffic given in x_p vector
computeWeightPerPath(double[]) - Method in class com.net2plan.libraries.CandidatePathList
Computes the weight of each path in the list, for the given weight of the links.
concatenate(double[]...) - Static method in class com.net2plan.utils.DoubleUtils
 
concatenate(int[]...) - Static method in class com.net2plan.utils.IntUtils
 
Configuration - Class in com.net2plan.interfaces.networkDesign
 
Configuration() - Constructor for class com.net2plan.interfaces.networkDesign.Configuration
 
ConnectionActions - Class in com.net2plan.interfaces.cacSimulation
Provides a set of actions to be returned by CAC algorithms.
ConnectionActions() - Constructor for class com.net2plan.interfaces.cacSimulation.ConnectionActions
 
ConnectionEvents - Class in com.net2plan.interfaces.cacSimulation
 
ConnectionEvents() - Constructor for class com.net2plan.interfaces.cacSimulation.ConnectionEvents
 
ConnectionNetState - Class in com.net2plan.interfaces.cacSimulation
 
ConnectionNetState(NetPlan) - Constructor for class com.net2plan.interfaces.cacSimulation.ConnectionNetState
 
Constants - Class in com.net2plan.utils
Auxiliary class with several application constants.
Constants() - Constructor for class com.net2plan.utils.Constants
 
Constants.CACAlgorithmDecision - Enum in com.net2plan.utils
 
Constants.NetworkElementType - Enum in com.net2plan.utils
 
Constants.OrderingType - Enum in com.net2plan.utils
 
Constants.ProvisioningEventType - Enum in com.net2plan.utils
 
Constants.SearchType - Enum in com.net2plan.utils
 
contains(double[], double) - Static method in class com.net2plan.utils.DoubleUtils
Checks if an input array contains a given value
contains(int[], int) - Static method in class com.net2plan.utils.IntUtils
Checks if an input array contains a given value
containsAll(int[], int[]) - Static method in class com.net2plan.utils.IntUtils
 
containsAny(double[], double[]) - Static method in class com.net2plan.utils.DoubleUtils
Checks whether any element of an array is present in another.
containsAny(int[], int[]) - Static method in class com.net2plan.utils.IntUtils
Checks whether any element of an array is present in another.
convert_fte2xp(int[][], int[][], double[], double[][], List<Integer>, List<int[]>, List<Double>) - Static method in class com.net2plan.libraries.GraphUtils
Given a destination-based routing in the form f_te (fractions of traffic in a node, that is forwarded through each of its output links), and an offered traffic to the network, it generates the resulting set of paths that are produced.
convert_xde2xp(int[][], int[][], double[][], List<Integer>, List<int[]>, List<Double>) - Static method in class com.net2plan.libraries.GraphUtils
 
convert_xde2ye(int[][], int[][], double[][]) - Static method in class com.net2plan.libraries.GraphUtils
 
convert_xp2fte(int[][], int[][], int[], double[], List<int[]>, int) - Static method in class com.net2plan.libraries.GraphUtils
 
convert_xp2xde(int[][], double[], int[], List<int[]>) - Static method in class com.net2plan.libraries.GraphUtils
 
convert_xp2xte(int[][], int[][], int[], double[], List<int[]>, int) - Static method in class com.net2plan.libraries.GraphUtils
 
convert_xp2ye(double[], List<int[]>, int) - Static method in class com.net2plan.libraries.GraphUtils
 
convert_xte2fte(int[][], double[][]) - Static method in class com.net2plan.libraries.GraphUtils
Given a destination-based routing in the form of an array x_te (amount of traffic targeted to node t, transmitted through node e), it returns the associated destination-based routing in the form of fractions f_te (fraction of the traffic targeted to node t that arrives (or is generated in) node a(e) (the initial node of link e), that is forwarded through link e).
convertBackupRoute2SequenceOfLinks(int[]) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
 
convertPathList2PathCost(List<int[]>, double[]) - Static method in class com.net2plan.libraries.GraphTheoryMetrics
 
convertSeqLinks2seqNodes(int[], int[][]) - Static method in class com.net2plan.libraries.GraphUtils
 
convertSequenceOfLinks2SequenceOfNodes(int[]) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
 
convertToNetPlan() - Method in class com.net2plan.interfaces.cacSimulation.ConnectionNetState
Converts the current network state to a network plan.
convertToNetPlan() - Method in class com.net2plan.interfaces.resilienceSimulation.FailureNetState
Converts the current network state to a network plan.
copy() - Method in class com.net2plan.interfaces.cacSimulation.ConnectionNetState
Returns a deep copy of the network state
copy() - Method in class com.net2plan.interfaces.networkDesign.NetPlan
Returns a deep copy of the network design.
copy() - Method in class com.net2plan.interfaces.resilienceSimulation.FailureNetState
Returns a deep copy of the network state
copy(double[]) - Static method in class com.net2plan.utils.DoubleUtils
Returns a deep copy of the input array.
copy(int[]) - Static method in class com.net2plan.utils.IntUtils
Returns a deep copy of the input array.
create() - Static method in class com.net2plan.interfaces.networkDesign.NetPlan
Returns an empty network design.
A B C D E F G H I J K L M N O P Q R S T U V Z