Package | Description |
---|---|
com.net2plan.interfaces.networkDesign |
Provides a set of classes and interfaces for the network design tool.
|
com.net2plan.libraries |
Provides a set of useful libraries to develop algorithms and reports.
|
com.net2plan.utils |
General utility static methods.
|
Modifier and Type | Method and Description |
---|---|
Pair<Demand,Demand> |
NetPlan.addDemandBidirectional(Node ingressNode,
Node egressNode,
double offeredTraffic,
Map<String,String> attributes,
NetworkLayer... optionalLayerParameter)
Adds two demands, one in each direction,.
|
Pair<Link,Link> |
NetPlan.addLinkBidirectional(Node originNode,
Node destinationNode,
double capacity,
double lengthInKm,
double propagationSpeedInKmPerSecond,
Map<String,String> attributes,
NetworkLayer... optionalLayerParameter)
Adds two links, one in each direction.
|
Pair<Set<MulticastTree>,Double> |
MulticastDemand.computeMinimumCostMulticastTrees(double[] costs)
Returns the multicast tree of this demand with lowest cost (and its cost), using the cost per link array provided.
|
Pair<Set<Route>,Double> |
Demand.computeShortestPathRoutes(double[] costs)
Returns the set of demand routes with shortest path (and its cost), using the cost per link array provided.
|
Modifier and Type | Method and Description |
---|---|
static Map<Demand,List<Pair<List<Link>,List<Link>>>> |
NetPlan.computeUnicastCandidate11PathList(Map<Demand,List<List<Link>>> cpl,
DoubleMatrix1D costs,
int disjointType)
Computes the list of disjoint path pairs for each demand.
|
Map<Pair<Demand,Link>,Double> |
ProtectionSegment.getForwardingRules()
This method cannot be called for protection segments (raises an exception)
|
Map<Pair<Demand,Link>,Double> |
Link.getForwardingRules()
Returns the non zero forwarding rules that are defined in the link.
|
Map<Pair<Demand,Link>,Double> |
Demand.getForwardingRules()
Returns the non zero forwarding rules as a map of pairs demand-link, and its associated splitting factor (between 0 and 1).
|
Map<Pair<Demand,Link>,Double> |
Node.getForwardingRules(Demand demand)
Returns the set of forwarding rules of links initiated in the node and associated to the given demand (the links are then in the same layer
as the demand), that have a non-zero splitting factor
|
Map<Pair<Demand,Link>,Double> |
Node.getForwardingRules(NetworkLayer... optionalLayerParameter)
Returns the set of forwarding rules of links initiated in the node of the given layer,
which have a non-zero splitting factor.
|
Map<Pair<Demand,Link>,Double> |
NetPlan.getForwardingRules(NetworkLayer... optionalLayerParameter)
Returns the forwarding rules for the given layer.
|
Modifier and Type | Method and Description |
---|---|
void |
NetPlan.addRoutesAndProtectionSegmentFromCandidate11PathList(Map<Demand,List<Pair<List<Link>,List<Link>>>> cpl11) |
Modifier and Type | Method and Description |
---|---|
static Pair<Double,Double> |
TrafficComputationEngine.getAverageHopsAndLengthOfMulticastTrees(List<MulticastTree> trees)
Returns the average number of hops (number of links) and km (summing all links) of the multicast trees in the network
|
static Pair<Double,Double> |
SRGUtils.getSRGDisjointnessPercentage(NetPlan netPlan,
NetworkLayer... optionalLayerParameter)
Returns the percentage of SRG disjointness of traffic routes and
protection segments.
|
static Pair<int[],int[]> |
WDMUtils.WA_firstFitTwoRoutes(List<Link> seqFibers_1,
List<Link> seqFibers_2,
DoubleMatrix2D wavelengthFiberOccupancy)
Wavelength assignment algorithm based on a first-fit fashion.
|
static Pair<int[],int[]> |
WDMUtils.WA_RPP_firstFit(List<Link> seqFibers,
DoubleMatrix2D wavelengthFiberOccupancy,
DoubleMatrix1D l_f,
DoubleMatrix1D nodeRegeneratorOccupancy,
double maxRegeneratorDistanceInKm)
Wavelength assignment algorithm based on a first-fit fashion assuming
full wavelength conversion and regeneration.
|
Modifier and Type | Method and Description |
---|---|
static List<Pair<Integer,Integer>> |
FlexGridUtils.computeAvailableSpectrumVoids(TreeSet<Integer> slotOccupancy,
int totalAvailableSlotsPerFiber)
Computes the list of spectral voids (list of available contiguous slots)
from a slot availability vector of a path.
|
Modifier and Type | Method and Description |
---|---|
static int |
FlexGridUtils.computeMaximumRequests(List<Pair<Integer,Integer>> availableSpectrumVoids,
int numSlots)
Computes the maximum number of requests (each one measured in number of slots) which
can be allocated in a set of spectrum voids.
|
Modifier and Type | Method and Description |
---|---|
static Pair<String,String> |
ClassLoaderUtils.getPackageAndClassName(String fullyQualifiedClassName)
Given a fully qualified class name returns the package and class names.
|
static <A,B> Pair<A,B> |
Pair.of(A a,
B b)
This factory allows a pair to be created using inference to obtain the generic types.
|
static <A,B> Pair<A,B> |
Pair.unmodifiableOf(A a,
B b)
This factory allows an unmodifiable pair to be created using inference to obtain the generic types.
|
Modifier and Type | Method and Description |
---|---|
static <A extends Number,B extends Number> |
DoubleUtils.convertMatrix2Map(Set<A> rowIdentifiers,
Set<B> columnIdentifiers,
DoubleMatrix2D matrix)
Returns a map containing the association of each identifier pair with its corresponding
value within the table (in linear order).
|
static <A extends Number,B extends Number> |
BooleanUtils.convertTable2Map(Set<A> rowIdentifiers,
Set<B> columnIdentifiers,
boolean[][] table)
Returns a map containing the association of each identifier pair with its corresponding
value within the table (in linear order).
|
static <A extends Number,B extends Number> |
DoubleUtils.convertTable2Map(Set<A> rowIdentifiers,
Set<B> columnIdentifiers,
double[][] table)
Returns a map containing the association of each identifier pair with its corresponding
value within the table (in linear order).
|
static <A extends Number,B extends Number> |
IntUtils.convertTable2Map(Set<A> rowIdentifiers,
Set<B> columnIdentifiers,
int[][] table)
Returns a map containing the association of each identifier pair with its corresponding
value within the table (in linear order).
|
static <A extends Number,B extends Number> |
LongUtils.convertTable2Map(Set<A> rowIdentifiers,
Set<B> columnIdentifiers,
long[][] table)
Returns a map containing the association of each identifier pair with its corresponding
value within the table (in linear order).
|
List<Pair<Double,Object>> |
TimeTrace.getList() |