| Package | Description |
|---|---|
| com.net2plan.interfaces.networkDesign |
Provides a set of classes and interfaces for the network design tool.
|
| com.net2plan.interfaces.simulation |
Provides a set of classes for the online simulator 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 |
|---|---|
Route |
NetPlan.addRoute(Demand demand,
double carriedTraffic,
double occupiedLinkCapacity,
List<Link> sequenceOfLinks,
Map<String,String> attributes)
Adds a new traffic route
|
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.
|
Route |
Route.createBidirectionalOppositePair()
Creates a route in the opposite direction as this, and associate both as bidirectional pairs.
|
Route |
Route.getBidirectionalPair()
If this route was added using the method addRouteBidirectional(),
returns the route in the other direction (if it was not previously removed).
|
Route |
NetPlan.getRoute(int index,
NetworkLayer... optionalLayerParameter)
Returns the route with the given index in the given layer.
|
Route |
NetPlan.getRouteFromId(long uid)
Returns the route with the given unique identifier.
|
| Modifier and Type | Method and Description |
|---|---|
Pair<SortedSet<Route>,Double> |
Demand.computeMinimumCostServiceChains(double[] linkCosts,
double[] resourceCosts)
Returns the set of demand service chains with shortest cost, using the cost per link and cost per resources arrays provided.
|
Pair<SortedSet<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.
|
SortedSet<Route> |
SharedRiskGroup.getAffectedRoutes(NetworkLayer layer)
Returns the set of routes in the given layer affected by the SRG (fail, when the SRG is in failure state)
|
SortedSet<Route> |
SharedRiskGroup.getAffectedRoutesAllLayers()
Returns the set of routes affected by the SRG (fail, when the SRG is in failure state).
|
SortedSet<Route> |
Node.getAssociatedRoutes(NetworkLayer... optionalLayerParameter)
Returns the set of routes that start, end or traverse this node, in the given layer.
|
List<Route> |
Route.getBackupRoutes()
Returns the list of backup routes for this route (the ones defined as backup by the user)
|
SortedSet<Route> |
Node.getExpressRoutes(NetworkLayer... optionalLayerParameter)
Returns the set of routes that traverse this node but not as the origin node of the first link, nor
the ending node of the last link
|
SortedSet<Route> |
Node.getIncomingRoutes(NetworkLayer... optionalLayerParameter)
Returns the set of routes ending in the node, in the given layer.
|
SortedSet<Route> |
NetPlan.getNodePairRoutes(Node originNode,
Node destinationNode,
boolean returnRoutesInBothDirections,
NetworkLayer... optionalLayerParameter)
Gets the set of routes at the given layer from the given nodes (if
returnRoutesInBothDirections is true, also the reversed routes are included). |
SortedSet<Route> |
Node.getOutgoingRoutes(NetworkLayer... optionalLayerParameter)
Returns the set of routes initiated in the node, in the given layer.
|
SortedSet<Route> |
Demand.getRoutes()
Returns the routes associated to this demand.
|
List<Route> |
NetPlan.getRoutes(NetworkLayer... optionalLayerParameter)
Returns the array of route ids for the given layer (i-th position, corresponds to index i).
|
SortedSet<Route> |
Demand.getRoutesAreBackup()
Returns the routes associated to this demand, but only those that are a backup route.
|
List<Route> |
NetPlan.getRoutesAreBackup(NetworkLayer... optionalLayerParameter)
Returns the list of routes which are not backup of any other route
|
SortedSet<Route> |
Demand.getRoutesAreNotBackup()
Returns the routes associated to this demand, but only those that are not a backup route.
|
List<Route> |
NetPlan.getRoutesAreNotBackup(NetworkLayer... optionalLayerParameter)
Returns the list of routes which are backup of any other route
|
SortedSet<Route> |
NetPlan.getRoutesDown(NetworkLayer... optionalLayerParameter)
Returns the set of routes that are down (traverse a link or node that is failed).
|
SortedSet<Route> |
Demand.getRoutesHaveBackup()
Returns the routes associated to this demand, but only those that are have themselves a backup route.
|
SortedSet<Route> |
Demand.getRoutesHaveNoBackup()
Returns the routes associated to this demand, but only those that have no backup route themselves.
|
SortedSet<Route> |
Route.getRoutesIAmBackup()
Return the set of routes that this route is a designated as a backup for them
|
SortedSet<Route> |
NetPlan.getRoutesTraversingZeroCapacityLinks(NetworkLayer... optionalLayerParameter)
Returns the set of routes that are traversing a link with zero capacity.
|
SortedSet<Route> |
NetPlan.getTaggedRoutes(String tag,
NetworkLayer... optionalLayerParameter)
Returns the set of routes in the given layer with the given tag.
|
SortedSet<Route> |
Link.getTraversingBackupRoutes()
Returns the set of routes traversing the link that are designated as backup of other route
|
SortedMap<Route,Double> |
Resource.getTraversingRouteOccupiedCapacityMap()
Returns a map with one key per each traversing route, and associated to it the amount of capacity occupied in this resource
because of it.
|
SortedSet<Route> |
Link.getTraversingRoutes()
Returns the
Routes traversing the link. |
SortedSet<Route> |
Resource.getTraversingRoutes()
Returns a set with the routes that are traversing this resource
|
SortedMap<Route,Integer> |
Link.getTraversingRoutesAndMultiplicity()
Returns a map with the routes traversing this link, and the number of times they traverse it
|
| Modifier and Type | Method and Description |
|---|---|
void |
Route.addBackupRoute(Route backupRoute)
Adds an existing route backupRoute in the same demand, designating it as a backup of this route.
|
double |
Resource.getTraversingRouteOccupiedCapacity(Route route)
Returns the capacity that is occupied in this resource, because of a traversing route.
|
void |
Route.removeBackupRoute(Route backupRoute)
Removes the given backupRoute from the backupRoute list of this route
|
void |
Route.setBidirectionalPair(Route r)
Sets the given route as the bidirectional pair of this route.
|
| Modifier and Type | Field and Description |
|---|---|
Route |
SimEvent.RouteRemove.route |
Route |
SimEvent.RouteModify.route |
Route |
SimEvent.RouteAdd.routeAddedToFillByProcessor |
| Constructor and Description |
|---|
RouteModify(Route route,
List<Link> seqLinks,
double carriedTraffic,
double occupiedLinkCapacity)
Default constructor.
|
RouteRemove(Route route)
Default constructor.
|
| Modifier and Type | Field and Description |
|---|---|
Route |
WDMUtils.LightpathRemove.lp
The Route object representing the lightpath to remove (in general, protection segments associated to this route will be also removed)
|
Route |
WDMUtils.LightpathModify.lp
The route object of the lightpath to modify
|
Route |
WDMUtils.LightpathAdd.lpAddedToFillByProcessor
The event generator puts a null here.
|
| Modifier and Type | Method and Description |
|---|---|
static Route |
WDMUtils.addLightpath(Demand demand,
WDMUtils.RSA rsa,
double lineRateGbps)
Creates a new lightpath with the given RSA, as a
Route object. |
| Modifier and Type | Method and Description |
|---|---|
static Pair<Map<Pair<Link,Integer>,List<Route>>,Map<Node,List<Route>>> |
WDMUtils.getNetworkSlotOccupancyMap(NetPlan netPlan,
boolean countFailedLightpaths,
NetworkLayer... optionalLayerParameter)
Returns two maps, showing the frequency slots in the links and signal regenerator in the nodes occupancies.
|
static Pair<Map<Pair<Link,Integer>,List<Route>>,Map<Node,List<Route>>> |
WDMUtils.getNetworkSlotOccupancyMap(NetPlan netPlan,
boolean countFailedLightpaths,
NetworkLayer... optionalLayerParameter)
Returns two maps, showing the frequency slots in the links and signal regenerator in the nodes occupancies.
|
| Modifier and Type | Method and Description |
|---|---|
static boolean |
WDMUtils.isWDMFormatCorrect(Route lp)
Returns true if the
Route object is a well formed lightpath, according to the WDMUtils requirements. |
static void |
WDMUtils.revertToInitialRSA(Route r)
The full RSA of the lightpath (travsersed fibers, occupied slots and regenerators) is reverted to its primary path.
|
static void |
WDMUtils.setLightpathRSAAttributes(Route lp,
WDMUtils.RSA rsa,
boolean initializeThePrimaryRoute)
Sets the attributes of the given
Route object to reflect the RSA occupation in current, primary or a backup path. |
| Modifier and Type | Method and Description |
|---|---|
static SortedMap<Demand,SortedMap<Link,Double>> |
GraphUtils.convert_xp2fdeMap(Collection<Route> routes)
Given a path-based routing, returns the forwarding rules map: fraction of traffic for each demand incoming to the link
initial node (or produced in it) forwarded to the link.
|
static DoubleMatrix2D |
GraphUtils.convert_xp2fte(List<Node> nodes,
List<Link> links,
List<Demand> demands,
List<Route> routes)
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).
|
static DoubleMatrix2D |
GraphUtils.convert_xp2xde(int D,
int E,
List<Route> routes)
Given a path-based routing, returns the amount of traffic for each demand d traversing each link e.
|
static DoubleMatrix2D |
GraphUtils.convert_xp2xte(List<Node> nodes,
List<Link> links,
List<Demand> demands,
List<Route> routes)
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).
|
static DoubleMatrix1D |
GraphUtils.convert_xp2ye(List<Link> links,
List<Route> routes)
Returns the carried traffic per link.
|
static double |
TrafficComputationEngine.getRouteAverageLength(List<Route> routes,
DoubleMatrix1D linkCostMap)
Obtains the average route length among the current routes according to
certain link cost metric.
|
| Constructor and Description |
|---|
LightpathModify(Route lp,
WDMUtils.RSA rsa,
double carriedTraffic)
Constructor to generate a new
LightpathModify object. |
LightpathRemove(Route lp)
Constructor to generate a new
LightpathRemove object. |
RSA(Route r,
boolean initializeWithTheInitialState)
Creates a RSA object reading the information from the existing Route object (and its WDM-related attributes).
|
| Modifier and Type | Method and Description |
|---|---|
Route |
WServiceChain.getNe() |
Route |
WLightpathUnregenerated.getNe() |
Copyright © 2018. All rights reserved.