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.research.niw.networkModel |
Modifier and Type | Method and Description |
---|---|
Resource |
NetPlan.addResource(String type,
String name,
Optional<Node> hostNode,
double capacity,
String capacityMeasurementUnits,
Map<Resource,Double> capacityIOccupyInBaseResource,
double processingTimeToTraversingTrafficInMs,
Map<String,String> attributes)
Adds a new Resource to the network.
|
Resource |
NetPlan.getResource(int index)
Returns the resource with the given index
|
Resource |
NetPlan.getResourceFromId(long uid)
Returns the resource with the given unique identifier.
|
Modifier and Type | Method and Description |
---|---|
SortedSet<Resource> |
Resource.getBaseResources()
Returns the set of base resources of this resource
|
SortedMap<Resource,Double> |
Resource.getCapacityOccupiedByUpperResourcesMap()
Returns the map with the information on the upper resources (the resources for which this resource is a base
resource), and the amount of occupied capacity they are incurring in me
|
SortedMap<Resource,Double> |
Resource.getCapacityOccupiedInBaseResourcesMap()
Returns the map with an element for each base resource, and the key the amount of capacity occupied in it
|
Pair<List<Resource>,DoubleMatrix2D> |
NetPlan.getMatrixResource2RouteAssignment(String type,
NetworkLayer... optionalLayerParameter)
Returns a matrix with as many rows resources, and columns as routes in the given layer,
coordinate (res,rou) contains the number times that route rou
traverses resource res.
|
List<Resource> |
NetPlan.getResources()
Returns the array of resources (i-th position, corresponds to index i).
|
SortedSet<Resource> |
Node.getResources(String... type)
Returns the set of resources that this node hosts.
|
SortedSet<Resource> |
NetPlan.getResources(String type)
Returns the set of resources in the network for the given type.
|
SortedSet<Resource> |
NetPlan.getResourcesAttachedToAnyNode()
Returns the set of resources which are attached to any node (that is, not unattached)
|
static List<Resource> |
Route.getSeqResources(List<? extends NetworkElement> seqLinksAndResources)
Given a path, composed of a sequence of links and resources, extracts the list of resources, filtering out the links
|
List<Resource> |
Route.getSeqResourcesTraversed()
Returns the route current sequence of traversed resources, in the order they are traversed (and thus, a resource will
appear as many times as it is traversed.
|
SortedSet<Resource> |
NetPlan.getTaggedResources(String tag)
Returns the set of resources with the given tag.
|
SortedSet<Resource> |
NetPlan.getUnattachedResources()
Returns the set of resources which are not attached to any node
|
SortedSet<Resource> |
Resource.getUpperResources()
Returns the set of resources that are above of this resource, so this resource is a base resource for them
|
Modifier and Type | Method and Description |
---|---|
double |
Resource.getCapacityOccupiedByUpperResource(Resource upperResource)
Returns the capacity that upperResource occupied in this resource.
|
double |
Resource.getCapacityOccupiedInBaseResource(Resource baseResource)
Returns the capacity that this resource is occupying in the base resource.
|
Modifier and Type | Method and Description |
---|---|
Resource |
NetPlan.addResource(String type,
String name,
Optional<Node> hostNode,
double capacity,
String capacityMeasurementUnits,
Map<Resource,Double> capacityIOccupyInBaseResource,
double processingTimeToTraversingTrafficInMs,
Map<String,String> attributes)
Adds a new Resource to the network.
|
void |
Resource.setCapacity(double newCapacity,
Map<Resource,Double> newCapacityIOccupyInBaseResourcesMap)
Resets the capacity of a resource, as well as the occupied capacity in the base resources.
|
Modifier and Type | Method and Description |
---|---|
static List<Pair<List<NetworkElement>,Double>> |
GraphUtils.getKMinimumCostServiceChains(List<Link> links,
Node originNode,
Node destinationNode,
List<String> sequenceOfResourceTypesToTraverse,
DoubleMatrix1D linkCost,
Map<Resource,Double> resourceCost,
int K,
double maxCostServiceChain,
double maxLengthInKmPerSubpath,
int maxNumHopsPerSubpath,
double maxPropDelayInMsPerSubpath,
Map<Pair<Node,Node>,List<Pair<List<Link>,Double>>> cacheSubpathLists)
Returns the K minimum cost service chains between two nodes (summing costs of links and resources traversed), traversing a given set of resource types, satisfying some user-defined constraints.
|
static Pair<List<NetworkElement>,Double> |
GraphUtils.getMinimumCostServiceChain(List<Link> links,
Node originNode,
Node destinationNode,
List<String> sequenceOfResourceTypesToTraverse,
DoubleMatrix1D linkCost,
Map<Resource,Double> resourceCost,
double maxLengthInKmPerSubpath,
int maxNumHopsPerSubpath,
double maxPropDelayInMsPerSubpath)
Returns the minimum cost service chain between two nodes (summing costs of links and resources traversed), traversing a given set of resource types, satisfying some user-defined constraints.
|
Modifier and Type | Method and Description |
---|---|
Resource |
WVnfInstance.getNe() |
Copyright © 2018. All rights reserved.