- calculateIGPCost(Map<Long, Double>, Map<Long, Double>) - Static method in class com.net2plan.libraries.IPUtils
-
Returns the cost of a routing scheme according to the carried traffic per
link and link capacities, assuming the IGP-WO cost model.
- calculateIGPCost(double[], double[]) - Static method in class com.net2plan.libraries.IPUtils
-
Returns the cost of a routing scheme according to the carried traffic per
link and the link capacity vectors, assuming the IGP-WO cost model.
- 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(File) - Constructor for class com.net2plan.libraries.CandidatePathList
-
Initializes the candidate path list, previously stored in a system file.
- CandidatePathList(NetPlan, String...) - Constructor for class com.net2plan.libraries.CandidatePathList
-
Initializes the candidate path list, computing all the paths for each
demand.
- CandidatePathList(NetPlan, long, String...) - Constructor for class com.net2plan.libraries.CandidatePathList
-
Initializes the candidate path list, computing all the paths for each
demand.
- CandidatePathList(NetPlan, Map<Long, Double>, String...) - Constructor for class com.net2plan.libraries.CandidatePathList
-
Initializes the candidate path list, computing all the paths for each
demand.
- CandidatePathList(NetPlan, long, Map<Long, Double>, String...) - Constructor for class com.net2plan.libraries.CandidatePathList
-
Initializes the candidate path list, computing all the paths for each
demand.
- ceil(double[]) - Static method in class com.net2plan.utils.DoubleUtils
-
Rounds up each element of a given double array.
- check(Map<String, String>) - Static method in class com.net2plan.interfaces.networkDesign.Configuration
-
Checks the given OPTIONS for validity.
- checkConsistency(NetPlan) - Static method in class com.net2plan.libraries.WDMUtils
-
Performs extra checks to those applicable to every network design, especially
focused on WDM networks.
- checkConsistency(NetPlan, long) - Static method in class com.net2plan.libraries.WDMUtils
-
Performs extra checks to those applicable to every network design, especially
focused on WDM networks.
- checkDemandIsActive(long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks whether a demand is active.
- checkDemandIsActive(long, long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks whether a demand is active.
- checkForwardingRuleIsActive(Pair<Long, Long>) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks whether a forwarding rule is active.
- checkForwardingRuleIsActive(long, Pair<Long, Long>) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks whether a forwarding rule is active.
- checkLayerIsActive(long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks whether a layer is active.
- checkLinkIsActive(long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks whether a link is active.
- checkLinkIsActive(long, long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks whether a link is active.
- checkNetworkState(NetPlan, Map<String, String>) - Static method in class com.net2plan.libraries.NetworkPerformanceMetrics
-
Checks the current network state and, maybe, returns some warnings about
link oversubscription, demand blocking, and so on.
- checkNodeIsActive(long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks whether a node is active.
- checkPathValidityForDemand(List<Long>, long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks whether a sequence of links (and maybe protection segments) is valid for a given demand.
- checkPathValidityForDemand(long, List<Long>, long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks whether a sequence of links (and maybe protection segments) is valid for a given demand.
- checkProtectionSegmentIsActive(long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks whether a protection segment is active.
- checkProtectionSegmentIsActive(long, long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks whether a protection segment is active.
- checkRouteContinuity(Map<Long, Pair<Long, Long>>, List<Long>, Constants.CheckRoutingCycleType) - Static method in class com.net2plan.libraries.GraphUtils
-
Checks for validity of a given path (continuity and, optionally, no loops).
- checkRouteIsActive(long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks whether a route is active.
- checkRouteIsActive(long, long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks whether a route is active.
- checkRoutingType(Constants.RoutingType) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks whether routing type is the expected one.
- checkRoutingType(long, Constants.RoutingType) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks whether routing type is the expected one.
- checkSRGIsActive(long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks whether an SRG is active.
- checkTrafficMatrix(DoubleMatrix2D) - Static method in class com.net2plan.libraries.TrafficMatrixGenerationModels
-
Checks whether the input traffic matrix is valid: non-negative square matrix with zero diagonal.
- checkValidity(Map<String, String>, boolean, boolean) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks the current state.
- checkValidity(long, Map<String, String>, boolean, boolean) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Checks the current state.
- ClassLoaderUtils - Class in com.net2plan.utils
-
Class to deal with dynamic Java class loading from .class/.jar files.
- CollectionUtils - Class in com.net2plan.utils
-
Provides extra functionality for the Java Collections Framework.
- com.net2plan.interfaces.networkDesign - package com.net2plan.interfaces.networkDesign
-
Provides a set of classes and interfaces for the network design tool.
- com.net2plan.interfaces.simulation - package com.net2plan.interfaces.simulation
-
Provides a set of classes for the online 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.
- compareCandidateToShortestPath(GraphUtils.GraphPath<E>, GraphUtils.GraphPath<E>) - Method in class com.net2plan.libraries.GraphUtils.YenAlgorithm
-
Indicates whether a path is valid when compared to the shortest path.
- compareTo(SimEvent) - Method in class com.net2plan.interfaces.simulation.SimEvent
-
- compareTo(GraphUtils.GraphPath) - Method in class com.net2plan.libraries.GraphUtils.GraphPath
-
Compares this object with the specified object for order.
- computeAvailableSpectrumVoids(TreeSet<Integer>, int) - Static method in class com.net2plan.libraries.FlexGridUtils
-
Computes the list of spectral voids (list of available contiguous slots)
from a slot availability vector of a path.
- computeCarriedTrafficFromIGPWeights(NetPlan, Map<Long, Double>) - Static method in class com.net2plan.libraries.IPUtils
-
Computes the resulting carried traffic according to a link weight setting
and OSPF/ECMP routing.
- computeCarriedTrafficFromIGPWeights(NetPlan, long, Map<Long, Double>) - Static method in class com.net2plan.libraries.IPUtils
-
Computes the resulting carried traffic according to a link weight setting
and OSPF/ECMP routing.
- computeDemandCarriedTraffic(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
- computeDemandShortestPathWeight(Map<Long, Double>) - Method in class com.net2plan.libraries.CandidatePathList
-
Returns the shortest path cost for every demand.
- computeECMPForwardingRules(Set<Long>, Map<Long, Pair<Long, Long>>, Map<Long, Pair<Long, Long>>, Map<Long, Double>) - Static method in class com.net2plan.libraries.IPUtils
-
Computes the forwarding rules according to an OSPF/ECMP scheme.
- computeECMPRoutingTableMap(Set<Long>, Map<Long, Pair<Long, Long>>, Map<Long, Double>) - Static method in class com.net2plan.libraries.IPUtils
-
Computes the routing table matrix according to an OSPF/ECMP scheme.
- computeECMPRoutingTableMatrix(Set<Long>, Map<Long, Pair<Long, Long>>, Map<Long, Double>) - Static method in class com.net2plan.libraries.IPUtils
-
Computes the routing table matrix according to an OSPF/ECMP scheme.
- computeEuclideanDistance(Point2D, Point2D) - Static method in class com.net2plan.libraries.GraphUtils
-
Computes the Euclidean distance between two points.
- computeFailureState2LinkUnavailabilityMatrix(NetPlan, List<Set<Long>>) - Static method in class com.net2plan.libraries.SRGUtils
-
Given a network design with a set of shared-risk groups (SRGs) and a set
of failure states, each of them containing the associated set of simultaneous
SRG failures, the failure state-link unavailability matrix.
- computeFailureState2LinkUnavailabilityMatrix(NetPlan, long, List<Set<Long>>) - Static method in class com.net2plan.libraries.SRGUtils
-
Given a network design with a set of shared-risk groups (SRGs) and a set
of failure states, each of them containing the associated set of simultaneous
SRG failures, the failure state-link unavailability matrix.
- computeHaversineDistanceInKm(Point2D, Point2D) - Static method in class com.net2plan.libraries.GraphUtils
-
Computes the Haversine distance between two points, that is, the shortest
distance over the Earth's surface.
- computeLinkCarriedTrafficMap(Map<Long, 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.
- computeLinkCarriedTrafficMap(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.
- computeLinkCarriedTrafficVector(Map<Long, Double>) - Method in class com.net2plan.libraries.CandidatePathList
-
Computes the amount of traffic in each link, if each path carries the
traffic given in y_p map.
- computeLinkCarriedTrafficVector(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.
- computeMatricesCAGR(DoubleMatrix2D, double, int) - Static method in class com.net2plan.libraries.TrafficMatrixGenerationModels
-
Computes a set of matrices from a seminal one, using a traffic forecast
based on the compound annual growth rate (CAGR) concept.
- computeMatricesRandomGaussianVariation(DoubleMatrix2D, double, double, int) - Static method in class com.net2plan.libraries.TrafficMatrixGenerationModels
-
Computes a set of matrices from a seminal one, using a random Gaussian distribution.
- computeMatricesRandomUniformVariation(DoubleMatrix2D, double, int) - Static method in class com.net2plan.libraries.TrafficMatrixGenerationModels
-
Computes a set of matrices from a seminal one, using a random uniform distribution.
- computeMaximumRequests(List<Pair<Integer, Integer>>, int) - Static method in class com.net2plan.libraries.FlexGridUtils
-
Computes the maximum number of requests (each one measured in number of slots) which
can be allocated in a set of spectrum voids.
- computeModulationFormat(double, Set<FlexGridUtils.ModulationFormat>) - Static method in class com.net2plan.libraries.FlexGridUtils
-
Returns the modulation format with the maximum spectral efficiency, whereas
the optical reach constraint is fulfilled, for the given path.
- computeModulationFormat(Map<Long, Double>, List<Long>, Set<FlexGridUtils.ModulationFormat>) - Static method in class com.net2plan.libraries.FlexGridUtils
-
Returns the modulation format with the maximum spectral efficiency, whereas
the optical reach constraint is fulfilled, for the given path.
- computeModulationFormatPerPath(CandidatePathList, Map<Long, Double>, Set<FlexGridUtils.ModulationFormat>) - Static method in class com.net2plan.libraries.FlexGridUtils
-
Returns the modulation format with the maximum spectral efficiency, while
the optical reach constraint is fulfilled, for each path in a
CandidatePathList
object.
- computeNumberOfSlots(double, double, double, FlexGridUtils.ModulationFormat) - Static method in class com.net2plan.libraries.FlexGridUtils
-
Computes the number of frequency slots required for a certain amount of
bandwidth (measured in Gbps), including guard-bands.
- computePathMaximumCarriedTrafficMap(Map<Long, Double>) - Method in class com.net2plan.libraries.CandidatePathList
-
Computes for each path the maximum amount of traffic that is expected to
carry in case of non-bifurcated routing, that is, the offered traffic of
its corresponding demand.
- computePathMaximumCarriedTrafficMap(double[]) - Method in class com.net2plan.libraries.CandidatePathList
-
Computes for each path the maximum amount of traffic that is expected to
carry in case of non-bifurcated routing, that is, the offered traffic of
its corresponding demand.
- computePathMaximumCarriedTrafficVector(Map<Long, Double>) - Method in class com.net2plan.libraries.CandidatePathList
-
Computes for each path the maximum amount of traffic that is expected to
carry in case of non-bifurcated routing, that is, the offered traffic of
its corresponding demand.
- computePathMaximumCarriedTrafficVector(double[]) - Method in class com.net2plan.libraries.CandidatePathList
-
Computes for each path the maximum amount of traffic that is expected to
carry in case of non-bifurcated routing, that is, the offered traffic of
its corresponding demand.
- computePathSlotOccupancy(List<Long>, Map<Long, TreeSet<Integer>>, int) - Static method in class com.net2plan.libraries.FlexGridUtils
-
Computes the slot availability vector of a path, represented by a sequence
of fibers, where each position indicates whether or not its corresponding
frequency slot is available along the path.
- computeRegeneratorPositions(Map<Long, Pair<Long, Long>>, List<Long>, Map<Long, Double>, double) - Static method in class com.net2plan.libraries.WDMUtils
-
Returns the list of nodes within the lightpath route containing a regenerator,
only following a distance criterium, assuming no wavelength conversion is required.
- computeRegeneratorPositions(Map<Long, Pair<Long, Long>>, List<Long>, int[], Map<Long, Double>, double) - Static method in class com.net2plan.libraries.WDMUtils
-
Returns the list of nodes within the lightpath route containing a regenerator,
only following a distance criterium, assuming wavelength conversion is required.
- computeRoadDistanceInKm(double) - Static method in class com.net2plan.libraries.GraphUtils
-
Applies a correction to a given airline distance (i.e.
- computeSRG2LinkUnavailabilityMatrix(NetPlan) - Static method in class com.net2plan.libraries.SRGUtils
-
Given a network design with a set of shared-risk groups (SRGs), it computes
the SRG-link unavailability matrix.
- computeSRG2LinkUnavailabilityMatrix(NetPlan, long) - Static method in class com.net2plan.libraries.SRGUtils
-
Given a network design with a set of shared-risk groups (SRGs), it computes
the SRG-link unavailability matrix.
- computeStateProbabilities(List<Set<Long>>, Map<Long, Double>) - Static method in class com.net2plan.libraries.SRGUtils
-
Computes the probability to find the network on each failure state.
- concatenate(double[]...) - Static method in class com.net2plan.utils.DoubleUtils
-
Concatenates a series of arrays.
- concatenate(int[]...) - Static method in class com.net2plan.utils.IntUtils
-
Concatenates a series of arrays.
- concatenate(long[]...) - Static method in class com.net2plan.utils.LongUtils
-
Concatenates a series of arrays.
- Configuration - Class in com.net2plan.interfaces.networkDesign
-
Class containing current Net2Plan-wide OPTIONS, and methods to work with them.
- Configuration() - Constructor for class com.net2plan.interfaces.networkDesign.Configuration
-
- configureLinkCostMap(Map<Long, Double>) - Method in class com.net2plan.libraries.GraphTheoryMetrics
-
Re-configures link cost setting.
- configureSRGs(NetPlan, double, double, SRGUtils.SharedRiskModel, boolean) - Static method in class com.net2plan.libraries.SRGUtils
-
Configures the SRGs into the network design at the first layer.
- configureSRGs(NetPlan, long, double, double, SRGUtils.SharedRiskModel, boolean) - Static method in class com.net2plan.libraries.SRGUtils
-
Configures the SRGs into the network design at the given layer.
- constantArray(int, double) - Static method in class com.net2plan.utils.DoubleUtils
-
Returns an array filled with a given value.
- constantArray(int, int) - Static method in class com.net2plan.utils.IntUtils
-
Returns an array filled with a given value.
- constantArray(int, long) - Static method in class com.net2plan.utils.LongUtils
-
Returns an array filled with a given value.
- constantMap(Set<A>, boolean) - Static method in class com.net2plan.utils.BooleanUtils
-
Returns a map filled with a given value.
- constantMap(Set<A>, double) - Static method in class com.net2plan.utils.DoubleUtils
-
Returns a map filled with a given value.
- constantMap(Set<A>, int) - Static method in class com.net2plan.utils.IntUtils
-
Returns a map filled with a given value.
- constantMap(Set<A>, long) - Static method in class com.net2plan.utils.LongUtils
-
Returns a map filled with a given value.
- Constants - Class in com.net2plan.utils
-
Auxiliary class with several application-wide constants.
- Constants.CheckRoutingCycleType - Enum in com.net2plan.utils
-
Indicates whether (and how) or not to check routing cycles.
- Constants.OrderingType - Enum in com.net2plan.utils
-
Constants for choosing the ordering type.
- Constants.RoutingCycleType - Enum in com.net2plan.utils
-
Types of routing cycles.
- Constants.RoutingType - Enum in com.net2plan.utils
-
Routing type determining how to get (or send traffic) from a node to another one.
- Constants.SearchType - Enum in com.net2plan.utils
-
Constants for search methods.
- constantTrafficMatrix(int, double) - Static method in class com.net2plan.libraries.TrafficMatrixGenerationModels
-
Generates a constant traffic matrix.
- contains(SimAction.ActionType) - Method in class com.net2plan.interfaces.simulation.SimEvent
-
Returns true if the event contains an action notification of the
given type.
- contains(Collection<A>, A) - Static method in class com.net2plan.utils.CollectionUtils
-
Checks if an input collection contains a given value.
- 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
- contains(long[], long) - Static method in class com.net2plan.utils.LongUtils
-
Checks if an input array contains a given value
- containsAll(Collection<A>, Collection<A>) - Static method in class com.net2plan.utils.CollectionUtils
-
Checks whether all elements of a collection are present in another one.
- containsAll(double[], double[]) - Static method in class com.net2plan.utils.DoubleUtils
-
Checks if an array contains all numbers from another one.
- containsAll(int[], int[]) - Static method in class com.net2plan.utils.IntUtils
-
Checks if an array contains all numbers from another one.
- containsAll(long[], long[]) - Static method in class com.net2plan.utils.LongUtils
-
Checks if an array contains all numbers from another one.
- containsAny(EnumSet<SimAction.ActionType>) - Method in class com.net2plan.interfaces.simulation.SimEvent
-
Returns true if the event contains an action notification of
among one of the given types.
- containsAny(Collection<A>, Collection<A>) - Static method in class com.net2plan.utils.CollectionUtils
-
Checks whether any element of a collection is present in another one.
- containsAny(double[], double[]) - Static method in class com.net2plan.utils.DoubleUtils
-
Checks whether any element of an array is present in another one.
- containsAny(int[], int[]) - Static method in class com.net2plan.utils.IntUtils
-
Checks whether any element of an array is present in another one.
- containsAny(long[], long[]) - Static method in class com.net2plan.utils.LongUtils
-
Checks whether any element of an array is present in another one.
- convert_fde2xde(Set<Long>, Map<Long, Pair<Long, Long>>, Map<Long, Pair<Long, Long>>, Map<Long, Double>, DoubleMatrix2D) - Static method in class com.net2plan.libraries.GraphUtils
-
Given a forwarding rule mapping (fractions of traffic entering a node from
demand 'd', leaving that node through link 'e'), and an offered
traffic to the network, it generates the resulting demand-link routing in
the form x_de (amount of traffic from demand d, transmitted through link e).
- convert_fde2xde(Set<Long>, Map<Long, Pair<Long, Long>>, Map<Long, Pair<Long, Long>>, Map<Long, Double>, Map<Pair<Long, Long>, Double>) - Static method in class com.net2plan.libraries.GraphUtils
-
Given a forwarding rule mapping (fractions of traffic entering a node from
demand 'd', leaving that node through link 'e'), and an offered
traffic to the network, it generates the resulting demand-link routing in
the form x_de (amount of traffic from demand d, transmitted through link e).
- convert_fde2xde(long, Set<Long>, Map<Long, Pair<Long, Long>>, Map<Long, Pair<Long, Long>>, Map<Long, Double>, Map<Pair<Long, Long>, Double>) - Static method in class com.net2plan.libraries.GraphUtils
-
Given a forwarding rule mapping (fractions of traffic entering a node from
demand 'd', leaving that node through link 'e'), and an offered
traffic to the network, it generates the resulting demand-link routing in
the form x_de (amount of traffic from demand d, transmitted through link e),
only for a given demand.
- convert_fte2fde(Map<Long, Pair<Long, Long>>, Map<Pair<Long, Long>, 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), it generates
the resulting demand-link routing in the form f_de (fractions of traffic in
a node from demand d, transmitted through link e).
- convert_fte2fde(Set<Long>, Map<Long, Pair<Long, Long>>, DoubleMatrix2D) - 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), it generates
the resulting demand-link routing in the form f_de (fractions of traffic in
a node from demand d, transmitted through link e).
- convert_fte2xde(Set<Long>, Map<Long, Pair<Long, Long>>, Map<Long, Pair<Long, Long>>, Map<Long, Double>, Map<Pair<Long, Long>, 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 demand-link routing in
the form x_de (amount of traffic from demand d, transmitted through link e).
- convert_fte2xp(Set<Long>, Map<Long, Pair<Long, Long>>, Map<Long, Pair<Long, Long>>, Map<Long, Double>, Map<Pair<Long, Long>, Double>, List<Long>, List<Double>, List<List<Long>>) - 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_fte2xp(Set<Long>, Map<Long, Pair<Long, Long>>, Map<Long, Pair<Long, Long>>, Map<Long, Double>, DoubleMatrix2D, List<Long>, List<Double>, List<List<Long>>) - 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_fte2xte(Set<Long>, Map<Long, Pair<Long, Long>>, DoubleMatrix2D, DoubleMatrix2D) - 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 destination-based
routing in the form x_te (amount of traffic targeted to node t, transmitted through link e).
- convert_fte2xte(Set<Long>, Map<Long, Pair<Long, Long>>, Map<Pair<Long, Long>, Double>, DoubleMatrix2D) - 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 destination-based
routing in the form x_te (amount of traffic targeted to node t, transmitted through link e).
- convert_xde2fde(Set<Long>, Map<Long, Pair<Long, Long>>, Set<Long>, Map<Pair<Long, Long>, Double>) - Static method in class com.net2plan.libraries.GraphUtils
-
Given a demand-link routing in the form x_de (amount of traffic from demand
d, transmitted through link e), returns the equivalent forwarding rule
mapping (fractions of traffic entering a node from demand 'd', leaving that
node through link 'e').
- convert_xde2xp(Map<Long, Pair<Long, Long>>, Map<Long, Pair<Long, Long>>, DoubleMatrix2D, List<Long>, List<Double>, List<List<Long>>) - Static method in class com.net2plan.libraries.GraphUtils
-
Given the amount of traffic for each demand d and traversing link e, it computes
the equivalent path-based routing.
- convert_xde2xp(Map<Long, Pair<Long, Long>>, Map<Long, Pair<Long, Long>>, Map<Pair<Long, Long>, Double>, List<Long>, List<Double>, List<List<Long>>) - Static method in class com.net2plan.libraries.GraphUtils
-
Given the amount of traffic for each demand d and traversing link e, it computes
the equivalent path-based routing.
- convert_xde2ye(Set<Long>, Map<Pair<Long, Long>, Double>) - Static method in class com.net2plan.libraries.GraphUtils
-
Returns the carried traffic per link.
- convert_xde2ye(DoubleMatrix2D) - Static method in class com.net2plan.libraries.GraphUtils
-
Returns the carried traffic per link.
- convert_xp2fte(Set<Long>, Map<Long, Pair<Long, Long>>, Map<Long, Pair<Long, Long>>, Map<Long, Long>, Map<Long, Double>, Map<Long, List<Long>>) - Static method in class com.net2plan.libraries.GraphUtils
-
Given a set of traffic routes and their carried traffic returns a destination-based
routing in the form fte (fractions of traffic in a node, that is forwarded
through each of its output links).
- convert_xp2xde(Map<Long, Pair<Long, Long>>, Set<Long>, Map<Long, Long>, Map<Long, Double>, Map<Long, List<Long>>) - Static method in class com.net2plan.libraries.GraphUtils
-
Given a path-based routing, returns the amount of traffic for each demand d
traversing each link e.
- convert_xp2xde(Map<Long, Pair<Long, Long>>, Map<Long, Long>, Map<Long, Double>, Map<Long, List<Long>>) - Static method in class com.net2plan.libraries.GraphUtils
-
Given a path-based routing, returns the amount of traffic for each demand d
traversing each link e.
- convert_xp2xte(Set<Long>, Map<Long, Pair<Long, Long>>, Map<Long, Pair<Long, Long>>, Map<Long, Long>, Map<Long, Double>, Map<Long, List<Long>>) - Static method in class com.net2plan.libraries.GraphUtils
-
Given a set of traffic routes and their carried traffic returns a destination-based
routing in the form x_te (amount of traffic targeted to node t, transmitted through link e).
- convert_xp2ye(Map<Long, Pair<Long, Long>>, List<Double>, List<List<Long>>) - Static method in class com.net2plan.libraries.GraphUtils
-
Returns the carried traffic per link.
- convert_xp2ye(Map<Long, Pair<Long, Long>>, double[], List<List<Long>>) - Static method in class com.net2plan.libraries.GraphUtils
-
Returns the carried traffic per link.
- convert_xte2fte(Set<Long>, Map<Long, Pair<Long, Long>>, DoubleMatrix2D) - 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 link 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).
- convert_xte2ye(DoubleMatrix2D) - Static method in class com.net2plan.libraries.GraphUtils
-
Returns the carried traffic per link.
- convertArray2Map(Set<A>, boolean[]) - Static method in class com.net2plan.utils.BooleanUtils
-
Returns a map containing the association of each identifier with its corresponding
value within the array (in linear order).
- convertArray2Map(Set<A>, double[]) - Static method in class com.net2plan.utils.DoubleUtils
-
Returns a map containing the association of each identifier with its corresponding
value within the array (in linear order).
- convertArray2Map(Set<A>, int[]) - Static method in class com.net2plan.utils.IntUtils
-
Returns a map containing the association of each identifier with its corresponding
value within the array (in linear order).
- convertArray2Map(Set<A>, long[]) - Static method in class com.net2plan.utils.LongUtils
-
Returns a map containing the association of each identifier with its corresponding
value within the array (in linear order).
- convertId2LinearIndexMap(Set<A>) - Static method in class com.net2plan.utils.CollectionUtils
-
Returns a map containing the association of each element with its corresponding
position within the set (in linear order).
- convertMatrix2Map(Set<A>, Set<B>, DoubleMatrix2D) - Static method in class com.net2plan.utils.DoubleUtils
-
Returns a map containing the association of each identifier pair with its corresponding
value within the table (in linear order).
- convertPath2PathCost(List<Long>, Map<Long, Double>) - Static method in class com.net2plan.libraries.GraphUtils
-
Returns the total cost for a given path, wjocj os equal to the sum of the cost of
each traversed link.
- convertPathList2PathCost(List<List<Long>>, Map<Long, Double>) - Static method in class com.net2plan.libraries.GraphUtils
-
Returns the total cost for a given a list of paths.
- convertSequenceOfLinksAndProtectionSegmentsToSequenceOfLinks(List<Long>) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Converts a sequence of links and protection segments to the actual sequence of links.
- convertSequenceOfLinksAndProtectionSegmentsToSequenceOfLinks(long, List<Long>) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Converts a sequence of links and protection segments to the actual sequence of links.
- convertSequenceOfLinksToSequenceOfNodes(Map<Long, Pair<Long, Long>>, List<Long>) - Static method in class com.net2plan.libraries.GraphUtils
-
Converts a given sequence of links to the corresponding sequence of nodes.
- convertTable2Map(Set<A>, Set<B>, boolean[][]) - Static method in class com.net2plan.utils.BooleanUtils
-
Returns a map containing the association of each identifier pair with its corresponding
value within the table (in linear order).
- convertTable2Map(Set<A>, Set<B>, double[][]) - Static method in class com.net2plan.utils.DoubleUtils
-
Returns a map containing the association of each identifier pair with its corresponding
value within the table (in linear order).
- convertTable2Map(Set<A>, Set<B>, int[][]) - Static method in class com.net2plan.utils.IntUtils
-
Returns a map containing the association of each identifier pair with its corresponding
value within the table (in linear order).
- convertTable2Map(Set<A>, Set<B>, long[][]) - Static method in class com.net2plan.utils.LongUtils
-
Returns a map containing the association of each identifier pair with its corresponding
value within the table (in linear order).
- copy() - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Returns a deep copy of the current design.
- copy(double[]) - Static method in class com.net2plan.utils.DoubleUtils
-
Returns a deep copy of the input array.
- 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.
- copy(int[][]) - Static method in class com.net2plan.utils.IntUtils
-
Returns a deep copy of the input array.
- copy(long[]) - Static method in class com.net2plan.utils.LongUtils
-
Returns a deep copy of the input array.
- copy(long[][]) - Static method in class com.net2plan.utils.LongUtils
-
Returns a deep copy of the input array.
- copyFrom(NetPlan) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Removes all the current information from the current NetPlan and copy the
information from the input NetPlan.
- copyFrom(NetPlan, Set<Long>) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Removes all the current information from the NetPlan and copy the
information all the specified layers from the input NetPlan.
- copyLayer() - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Copies the default layer as a new layer.
- copyLayer(long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Copies a given layer as a new layer.
- copyLayerFrom(NetPlan) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Copies the default layer from a given network design as a new layer.
- copyLayerFrom(NetPlan, long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Copies a given layer from a given network as a new layer.
- count(Collection<A>) - Static method in class com.net2plan.utils.CollectionUtils
-
Returns a map where each entry represents the number of times that the
corresponding key appears in the input collection.
- coupleDemandWithUpperLayerLink(long, long, long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Couples a demand in the default layer to a link in an upper layer.
- coupleDemandWithUpperLayerLink(long, long, long, long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Couples a demand in the given layer to a link in an upper layer.
- coupleLinkWithLowerLayerDemand(long, long, long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Couples a link in the default layer to a demand in a lower layer.
- coupleLinkWithLowerLayerDemand(long, long, long, long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Couples a link in the given layer to a demand in a lower layer.
- createImage(Graph<V, E>, Transformer<V, Point2D>, int, int, int, float, float) - Static method in class com.net2plan.libraries.GraphUtils.JUNGUtils
-
Creates an image of the network topology.
- createLowerLayerDemandFromLink(long, long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Creates a lower layer demand from a given link.
- createLowerLayerDemandFromLink(long, long, long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Creates a lower layer demand from a given link.
- createLowerLayerDemandsFromLinks(long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Creates lower layer demands from existing links.
- createLowerLayerDemandsFromLinks(long, long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Creates lower layer demands from existing links.
- createUpperLayerLinkFromDemand(long, long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Creates an upper layer link from a given demand.
- createUpperLayerLinkFromDemand(long, long, long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Creates an upper layer link from a given demand.
- createUpperLayerLinksFromDemands(long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Creates upper layer links from existing demands.
- createUpperLayerLinksFromDemands(long, long) - Method in class com.net2plan.interfaces.networkDesign.NetPlan
-
Creates upper layer links from existing demands.