| 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 | Class and Description |
|---|---|
class |
Demand
This class contains a representation of a unicast demand.
|
class |
Link
This class contains a representation of a link.
|
class |
MulticastDemand
This class contains a representation of a multicast demand.
|
class |
MulticastTree
This class contains a representation of a unidirectional multicast tree, an structure used to carry traffic from multicast demands.
|
class |
NetPlan
Class defining a complete multi-layer network structure.
|
class |
NetworkLayer
This class contains a representation of a network layer.
|
class |
Node
This class contains a representation of a node.
|
class |
Resource
.
|
class |
Route
This class contains a representation of a unidirectional route, an structure used to carry traffic of unicast demands at a layer,
when the layer routing type is source routing.
|
class |
SharedRiskGroup |
| Modifier and Type | Method and Description |
|---|---|
NetworkElement |
NetPlan.getNetworkElement(long id)
Return the network element with the given unique id.
|
static NetworkElement |
NetPlan.getNetworkElementByAttribute(Collection<? extends NetworkElement> listOfElements,
String attribute,
String value)
Returns the first network element among the ones passed as input parameters, that has the given key-value as attribute.
|
| Modifier and Type | Method and Description |
|---|---|
static SortedMap<Demand,List<Pair<List<NetworkElement>,List<NetworkElement>>>> |
NetPlan.computeUnicastCandidate11ServiceChainList(SortedMap<Demand,List<List<NetworkElement>>> cpl,
int disjointType)
Computes a list of disjoint service chain pairs for each demand (service chain requests), using the service chain paths in the input
candidate path list given.
|
static SortedMap<Demand,List<Pair<List<NetworkElement>,List<NetworkElement>>>> |
NetPlan.computeUnicastCandidate11ServiceChainList(SortedMap<Demand,List<List<NetworkElement>>> cpl,
int disjointType)
Computes a list of disjoint service chain pairs for each demand (service chain requests), using the service chain paths in the input
candidate path list given.
|
SortedMap<Demand,List<List<NetworkElement>>> |
NetPlan.computeUnicastCandidateServiceChainList(DoubleMatrix1D linkCosts,
DoubleMatrix1D resourceCosts,
int K,
double maxCostServiceChain,
double maxLengthInKmPerSubpath,
int maxNumHopsPerSubpath,
double maxPropDelayInMsPerSubpath,
NetworkLayer... optionalLayerParameter)
Computes for each demand (service chain request) up to k minimum cost service chain paths (sequence and links and resources), according to
the link and resources cost information provided, as well as other constraints defined in the input parameters.
|
static SortedMap<NetworkElement,String> |
NetPlan.getAttributes(Collection<? extends NetworkElement> collection,
String attribute)
Returns the values of a given attribute for all the provided network elements.
|
Triple<Double,List<NetworkElement>,List<Double>> |
Route.getInitialState()
Returns the initial state of the route (the one when it was created): the carried traffic (in the no-failure state), its path (sequence of links and/or resources), and the occupation information (occupation in each link/resource travserse).
|
static Collection<? extends NetworkElement> |
NetPlan.getNetworkElementsByAttribute(Collection<? extends NetworkElement> listOfElements,
String attribute,
String value)
Returns all the network elements among the ones passed as input parameters, that have the given key-value as attribute.
|
List<NetworkElement> |
Route.getOppositePath()
Return the opposite path of this route, from the destination to the origin traversing the
bidirectional pairs of the traversed links, and the same resources.
|
List<NetworkElement> |
Route.getPath()
Return the current path (sequence of links and resources) of the route.
|
| Modifier and Type | Method and Description |
|---|---|
int |
NetworkElement.compareTo(NetworkElement o) |
int |
Route.getNumberOfTimesIsTraversed(NetworkElement e)
Returns the number of times that a particular link or resource is traversed
|
double |
Route.getOccupiedCapacity(NetworkElement... e)
Returns the route occupied capacity at this moment, at the particular link or resource.
|
double |
Route.getOccupiedCapacityInNoFailureState(NetworkElement... e)
The same as getOccupiedCapacity, but if the network had no failures
|
| Modifier and Type | Method and Description |
|---|---|
Route |
NetPlan.addServiceChain(Demand demand,
double carriedTraffic,
List<Double> occupiedLinkAndResourceCapacities,
List<? extends NetworkElement> sequenceOfLinksAndResources,
Map<String,String> attributes)
Adds a new traffic service chain, which is a route which also traverses and occupied resources.
|
boolean |
SharedRiskGroup.affectsAnyOf(Collection<? extends NetworkElement> col)
Returns true if any element of the given collection of links, nodes and resources is affected by te SRG (fails if the SRG fails), false otherwise
|
static SortedMap<Demand,List<Pair<List<NetworkElement>,List<NetworkElement>>>> |
NetPlan.computeUnicastCandidate11ServiceChainList(SortedMap<Demand,List<List<NetworkElement>>> cpl,
int disjointType)
Computes a list of disjoint service chain pairs for each demand (service chain requests), using the service chain paths in the input
candidate path list given.
|
static SortedMap<NetworkElement,String> |
NetPlan.getAttributes(Collection<? extends NetworkElement> collection,
String attribute)
Returns the values of a given attribute for all the provided network elements.
|
static DoubleMatrix1D |
NetPlan.getAttributeValues(Collection<? extends NetworkElement> collection,
String attributeName,
double defaultValue)
Returns the values of a given attribute for all the provided network elements, as a
DoubleMatrix1D vector. |
static Collection<Long> |
NetPlan.getIds(Collection<? extends NetworkElement> collection)
Returns the unique ids of the provided network elements.
|
static Collection<Integer> |
NetPlan.getIndexes(Collection<? extends NetworkElement> collection)
Returns the indexes of the provided network elements.
|
static NetworkElement |
NetPlan.getNetworkElementByAttribute(Collection<? extends NetworkElement> listOfElements,
String attribute,
String value)
Returns the first network element among the ones passed as input parameters, that has the given key-value as attribute.
|
static Collection<? extends NetworkElement> |
NetPlan.getNetworkElementsByAttribute(Collection<? extends NetworkElement> listOfElements,
String attribute,
String value)
Returns all the network elements among the ones passed as input parameters, that have the given key-value as attribute.
|
static List<Link> |
Route.getSeqLinks(List<? extends NetworkElement> seqLinksAndResources)
Given a path, composed of a sequence of links and resources, extracts the list of links, filtering out the resources
|
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
|
DoubleMatrix1D |
NetPlan.getVectorAttributeValues(Collection<? extends NetworkElement> collection,
String attributeKey)
Retuns a vector with the values of all given network elements for the given attribute key.
|
boolean |
NetPlan.isUp(Collection<? extends NetworkElement> col)
Indicates whether or not a path, multicast tree or arbitrary collection of links and/or resources and/or nodes is up and belonging to this netPlan object (so they were not removed), and false otherwise
|
void |
Route.setPath(double newCarriedTraffic,
List<? extends NetworkElement> newPath,
List<Double> newOccupationInformation)
Sets the new sequence of links and/or resources traversed by the route, carried traffic, and occupied capacity in the traversed links/resources
If the new route traverses failing link or nodes, its current
carried traffic and occupied link capacities will be zero.
|
void |
NetPlan.setVectorAttributeValues(Collection<? extends NetworkElement> collection,
String attributeKey,
DoubleMatrix1D values)
Sets the given attributes values to all the given network elements.
|
| 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 |
|---|---|
static DoubleMatrix2D |
GraphUtils.getAdjacencyMatrix(List<Node> nodes,
List<? extends NetworkElement> linkMap)
Given a map of links, it computes the adjacency matrix.
|
static DoubleMatrix2D |
GraphUtils.getIncidenceMatrix(List<Node> nodes,
List<? extends NetworkElement> elements)
Given a list of Network Elements, it computes the node-network element incidence matrix.
|
static DoubleMatrix2D |
GraphUtils.getIncomingIncidenceMatrix(List<Node> nodes,
List<? extends NetworkElement> elements)
Given a list of Network Element, it computes the node-network element incoming incidence matrix.
|
static DoubleMatrix2D |
GraphUtils.getOutgoingIncidenceMatrix(List<Node> nodes,
List<? extends NetworkElement> elements)
Given a list of Network elements, it computes the node-network element outgoing incidence matrix.
|
static boolean |
GraphUtils.isWeightedBidirectional(List<Node> nodes,
List<? extends NetworkElement> elements,
DoubleMatrix1D linkCostMap)
Checks whether the physical topology has the same number of links/demands between each node pair in both directions (assuming multi-digraphs) and same weights per direction.
|
| Modifier and Type | Method and Description |
|---|---|
abstract NetworkElement |
WAbstractNetworkElement.getNe()
Returns the underlying Net2Plan object.
|
Copyright © 2018. All rights reserved.