Demand (net2plan-javadoc 0.6.0.1 API)

java.lang.Object
- com.net2plan.interfaces.networkDesign.NetworkElement
- - com.net2plan.interfaces.networkDesign.Demand

All Implemented Interfaces:

Comparable<NetworkElement>
```
public class Demand
extends NetworkElement
```
This class contains a representation of a unicast demand. Unicast demands are defined by its initial and end node, the network layer they belong to, and their offered traffic. When the routing in the network layer is the type SOURCE_ROUTING, demands are carried throgh Route objects associated to them. If the routing type is HOP_BY_HOP_ROUTING, the demand traffic is carried by defining the forwarding rules (for each demand and link, fraction of the demand traffic from the link initial node, that is carried through it).

In multilayer design, a demand in a lower layer can be coupled to a link in the upper layer. Then, the demand carried traffic is equal to the upper layer link capacity (thus, upper link capacity and lower layer demand traffic must be measured in the same units).

Author:

Pablo Pavon-Marino

See Also:

Node, Route, Link

Nested Class Summary

Nested Classes
Modifier and Type Class and Description

static class Demand.IntendedRecoveryType

Nested Classes
Modifier and Type	Class and Description
`static class`	`Demand.IntendedRecoveryType`

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`void`	`checkRoutingType(Constants.RoutingType routingType)` Checks whether routing type is the expected one.
`Pair<SortedSet<Route>,Double>`	`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>`	`computeShortestPathRoutes(double[] costs)` Returns the set of demand routes with shortest path (and its cost), using the cost per link array provided.
`Link`	`coupleToNewLinkCreated(NetworkLayer newLinkLayer)` Creates a new link in the given layer with same end nodes, and couples it to this demand.
`void`	`coupleToUpperOrSameLayerLink(Link link)` Couples this demand to a link in an upper layer.
`Demand`	`createBidirectionalPair()` Creates a demand in the opposite direction as this, and with the same attributes, and associate both as bidirectional pairs.
`void`	`decouple()` Decouples this demand from an other layer link.
`Demand`	`getBidirectionalPair()` If this demand was added using the method addDemandBidirectional(), returns the demand in the other direction (if it was not previously removed).
`double`	`getBlockedTraffic()` Returns the blocked traffic of the demand (offered minus carried, or 0 if carried is above offered).
`double`	`getCarriedTraffic()` Returns the carried traffic of the demand.
`Link`	`getCoupledLink()` Returns the link this demand is coupled to.
`Node`	`getEgressNode()` Returns the demand egress node.
`SortedSet<Node>`	`getEndNodes()` Returns a non-modifiable set of two elements, with the demand end nodes
`SortedMap<Pair<Demand,Link>,Double>`	`getForwardingRules()` Returns the non zero forwarding rules as a map of pairs demand-link, and its associated splitting factor (between 0 and 1).
`Node`	`getIngressNode()` Returns the demand ingress node.
`Demand.IntendedRecoveryType`	`getIntendedRecoveryType()` Returns the specified intended recovery type for this demand
`NetworkLayer`	`getLayer()` Returns the `NetworkLayer` object this element is attached to.
`Pair<SortedSet<Link>,SortedSet<Link>>`	`getLinksNoDownPropagationPotentiallyCarryingTraffic()` Returns the set of links in this layer that could potentially carry traffic of this demand, according to the routes/forwarding rules defined, if the routes had carried traffic / (hop-by-hop) the demand had offered traffic different to zero.
`SortedSet<Link>`	`getLinksWithNonZeroForwardingRules()` Returns the set of links in this layer, with non zero forwarding rules defined for them.
`double`	`getMaximumAcceptableE2EWorstCaseLatencyInMs()` Returns the maximum e2e latency registered as acceptable for the demand (in ms)
`TrafficSeries`	`getMonitoredOrForecastedOfferedTraffic()` Returns the object contianing the monitored or forecasted time series information for the offered traffic
`double`	`getOccupiedCapacity(Link e)` Returns the amount of occupied capacity of the demand in a particular link
`double`	`getOfferedTraffic()` Returns the offered traffic of the demand
`double`	`getOfferedTrafficPerPeriodGrowthFactor()` Return the growth factor of the offered traffic in subsequent periods.
`String`	`getQosType()` Return the QoS type of the demand
`SortedSet<Route>`	`getRoutes()` Returns the routes associated to this demand.
`SortedSet<Route>`	`getRoutesAreBackup()` Returns the routes associated to this demand, but only those that are a backup route.
`SortedSet<Route>`	`getRoutesAreNotBackup()` Returns the routes associated to this demand, but only those that are not a backup route.
`SortedSet<Route>`	`getRoutesHaveBackup()` Returns the routes associated to this demand, but only those that are have themselves a backup route.
`SortedSet<Route>`	`getRoutesHaveNoBackup()` Returns the routes associated to this demand, but only those that have no backup route themselves.
`Constants.RoutingCycleType`	`getRoutingCycleType()` Returns the routing cycle type of the demand, indicating if the traffic is routed in a loopless form, with open loops or with closed loops (the latter can only happen in `HOP_BY_HOP_ROUTING` routing).
`Constants.RoutingType`	`getRoutingType()` Returns the routing type of the demand.
`List<String>`	`getServiceChainSequenceOfTraversedResourceTypes()` Gets the sequence of types of resources defined (the ones that the routes of this demand have to follow).
`SortedMap<Link,Double>`	`getTraversedLinksAndCarriedTraffic(boolean normalizedToOfferedTraffic)` Returns a map with an entry for each traversed link, and associated to it the demand's traffic carried in that link.
`double`	`getWorstCaseLengthInKm()` Returns the worse case end-to-end length in km of the demand traffic.
`double`	`getWorstCasePropagationTimeInMs()` Returns the worse case end-to-end propagation time of the demand traffic.
`boolean`	`isBidirectional()` Returns true if the demand is bidirectional.
`boolean`	`isBifurcated()` If routing is `SOURCE_ROUTING`, return `true` if more than one route is associated to this demand (routes down or with zero carried traffic also count).
`boolean`	`isBlocked()` Returns `true` if the carried traffic is strictly less than the offered traffic, up to the Net2Plan-wide precision factor.
`boolean`	`isCoupled()` Returns `true` if the demand is coupled to a link of an upper layer.
`boolean`	`isCoupledInDifferentLayer()` Returns `true` if the demand is coupled to a link in a different layer than the demnad (and thus an upper layer) , false otherwise.
`boolean`	`isCoupledInSameLayer()` Returns `true` if the demand is coupled to a link in the same layer as the demand, false otherwise.
`boolean`	`isServiceChainRequest()` Returns if the current demand reflects a service chain request, that is, if the routes are constrained to traverse a given sequence of resources of given types.
`boolean`	`isSourceRouting()` Returns true if the routing type in this demand is of the type source routing
`boolean`	`isTraversingOversubscribedLinks()` Returns `true` if the traffic of the demand is traversing an oversubscribed link, `false` otherwise.
`boolean`	`isTraversingOversubscribedResources()` Returns `true` if the traffic of the demand is traversing an oversubscribed resource, `false` otherwise.
`void`	`remove()` Removes a demand, and any associated routes or forwarding rules.
`void`	`removeAllForwardingRules()` Removes all forwarding rules associated to the demand.
`void`	`removeAllRoutes()` Removes all forwarding rules associated to the demand.
`void`	`setBidirectionalPair(Demand d)` Sets the given demand as the bidirectional pair of this demand.
`void`	`setIntendedRecoveryType(Demand.IntendedRecoveryType recoveryType)` Sets the intended recovery type for this demand
`void`	`setMaximumAcceptableE2EWorstCaseLatencyInMs(double maxLatencyMs)` Sets the maximum latency in ms acceptable for the demand.
`void`	`setMonitoredOrForecastedOfferedTraffic(TrafficSeries newTimeSeries)` Sets the new time series for the monitored or forecasted offered traffic, eliminating any previous values
`void`	`setOfferedTraffic(double offeredTraffic)` Sets the offered traffic by a demand.
`void`	`setOfferedTrafficPerPeriodGrowthFactor(double growthFactor)` Sets the growth factor of the offered traffic in subsequent periods.
`void`	`setQoSType(String newQosType)` Sets the QoS type of the demand.
`void`	`setRoutingType(Constants.RoutingType newRoutingType)` Sets the routing type at the given layer.
`void`	`setServiceChainSequenceOfTraversedResourceTypes(List<String> resourceTypesSequence)` Sets the sequence of types of resources that the routes of this demand have to follow.
`String`	`toString()` Returns a `String` representation of the demand.

Methods inherited from class java.lang.Object
getClass, hashCode, notify, notifyAll, wait, wait, wait

- Method Detail
  - checkRoutingType
```
public void checkRoutingType(Constants.RoutingType routingType)
```
    Checks whether routing type is the expected one. When negative, an exception will be thrown.
    
    Parameters:
    
    routingType - Expected RoutingType
  - computeMinimumCostServiceChains
```
public Pair<SortedSet<Route>,Double> 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. If more than one minimum cost route exists, all of them are provided. If the link cost vector provided is null, all links have cost one. The same for the resource costs array.
    
    Parameters:
    
    linkCosts - Costs for each link (indexed by link index)
    
    resourceCosts - the costs of the resources (indexed by resource index)
    
    Returns:
    
    Pair where the first element is a set of routes (may be empty) and the second element the minimum cost (will be Double.MAX_VALUE if there is no shortest path)
  - computeShortestPathRoutes
```
public Pair<SortedSet<Route>,Double> computeShortestPathRoutes(double[] costs)
```
    Returns the set of demand routes with shortest path (and its cost), using the cost per link array provided. If more than one shortest route exists, all of them are provided. If the cost vector provided is null, all links have cost one.
    
    Parameters:
    
    costs - Costs for each link
    
    Returns:
    
    Pair where the first element is a set of routes (may be empty) and the second element the minimum cost (may be Double.MAX_VALUE if there is no shortest path)
  - coupleToNewLinkCreated
```
public Link coupleToNewLinkCreated(NetworkLayer newLinkLayer)
```
    Creates a new link in the given layer with same end nodes, and couples it to this demand.
    
    Parameters:
    
    newLinkLayer - Layer where the link will be created.
    
    Returns:
    
    The new created link
  - coupleToUpperOrSameLayerLink
```
public void coupleToUpperOrSameLayerLink(Link link)
```
    Couples this demand to a link in an upper layer. After the link is coupled, its capacity will be always equal to the demand carried traffic.
    
    Important: The link and the demand must belong to different layers, have same end nodes, not be already coupled, and the traffic units of the demand must be the same as the capacity units of the link. Also, the coupling of layers cannot create a loop.
    
    Parameters:
    
    link - Link to be coupled
  - createBidirectionalPair
```
public Demand createBidirectionalPair()
```
    Creates a demand in the opposite direction as this, and with the same attributes, and associate both as bidirectional pairs. If this demand is already bidirectional, makes nothing and returns null
    
    Returns:
    
    the newly created demand
  - decouple
```
public void decouple()
```
    Decouples this demand from an other layer link. Throws an exception if the demand is not currently coupled.
  - getBidirectionalPair
```
public Demand getBidirectionalPair()
```
    If this demand was added using the method addDemandBidirectional(), returns the demand in the other direction (if it was not previously removed). Returns null otherwise.
    
    Returns:
    
    the demand in the other direction, if this demand was created with addDemandBidirectional(), or null otherwise
  - getBlockedTraffic
```
public double getBlockedTraffic()
```
    Returns the blocked traffic of the demand (offered minus carried, or 0 if carried is above offered).
    
    Returns:
    
    The demand blocked traffic
  - getCarriedTraffic
```
public double getCarriedTraffic()
```
    Returns the carried traffic of the demand.
    
    Returns:
    
    The demand carried traffic
  - getCoupledLink
```
public Link getCoupledLink()
```
    Returns the link this demand is coupled to.
    
    Returns:
    
    the coupled link, or null if the demand is not coupled
  - getEgressNode
```
public Node getEgressNode()
```
    Returns the demand egress node.
    
    Returns:
    
    The egress node
  - getEndNodes
```
public SortedSet<Node> getEndNodes()
```
    Returns a non-modifiable set of two elements, with the demand end nodes
    
    Returns:
    
    see above
  - getForwardingRules
```
public SortedMap<Pair<Demand,Link>,Double> getForwardingRules()
```
    Returns the non zero forwarding rules as a map of pairs demand-link, and its associated splitting factor (between 0 and 1).
    
    Important: If routing type is set to HOP_BY_HOP_ROUTING an exception will be thrown.
    
    Returns:
    
    a map with the forwarding rules. The map is empty if no non-zero forwarding rules are defined.
  - getIngressNode
```
public Node getIngressNode()
```
    Returns the demand ingress node.
    
    Returns:
    
    The ingress node
  - getIntendedRecoveryType
```
public Demand.IntendedRecoveryType getIntendedRecoveryType()
```
    Returns the specified intended recovery type for this demand
    
    Returns:
    
    see above
  - getLayer
```
public NetworkLayer getLayer()
```
    Returns the NetworkLayer object this element is attached to.
    
    Returns:
    
    The NetworkLayer object
  - getLinksNoDownPropagationPotentiallyCarryingTraffic
```
public Pair<SortedSet<Link>,SortedSet<Link>> getLinksNoDownPropagationPotentiallyCarryingTraffic()
```
    Returns the set of links in this layer that could potentially carry traffic of this demand, according to the routes/forwarding rules defined, if the routes had carried traffic / (hop-by-hop) the demand had offered traffic different to zero. The method returns a pair of sets (disjoint or not), first set with the set of links potentially carrying primary traffic and second with links in backup routes. Potentially carrying traffic means that (i) in source routing, down routes are not included, but all up routes are considered even if the carry zero traffic, (ii) in hop-by-hop routing the links are computed even if the demand offered traffic is zero, and all the links are considered primary. Naturally, forwarding rules of failed links apply as zero
    
    Returns:
    
    see above
  - getLinksWithNonZeroForwardingRules
```
public SortedSet<Link> getLinksWithNonZeroForwardingRules()
```
    Returns the set of links in this layer, with non zero forwarding rules defined for them. The link may or may not carry traffic, and may be or not be failed.
    
    Returns:
    
    see above
  - getMaximumAcceptableE2EWorstCaseLatencyInMs
```
public double getMaximumAcceptableE2EWorstCaseLatencyInMs()
```
    Returns the maximum e2e latency registered as acceptable for the demand (in ms)
    
    Returns:
    
    see above
  - getMonitoredOrForecastedOfferedTraffic
```
public TrafficSeries getMonitoredOrForecastedOfferedTraffic()
```
    Returns the object contianing the monitored or forecasted time series information for the offered traffic
    
    Returns:
    
    see above
  - getOccupiedCapacity
```
public double getOccupiedCapacity(Link e)
```
    Returns the amount of occupied capacity of the demand in a particular link
    
    Parameters:
    
    e - see above
    
    Returns:
    
    see above
  - getOfferedTraffic
```
public double getOfferedTraffic()
```
    Returns the offered traffic of the demand
    
    Returns:
    
    The offered traffic
  - getOfferedTrafficPerPeriodGrowthFactor
```
public double getOfferedTrafficPerPeriodGrowthFactor()
```
    Return the growth factor of the offered traffic in subsequent periods.
    
    Returns:
    
    see above
  - getQosType
```
public String getQosType()
```
    Return the QoS type of the demand
    
    Returns:
    
    see above
  - getRoutes
```
public SortedSet<Route> getRoutes()
```
    Returns the routes associated to this demand.
    
    Important: If network layer routing type is not SOURCE_ROUTING, an exception is thrown.
    
    Returns:
    
    The set of routes as an unmodifiable set, an empty set if no route exists.
  - getRoutesAreBackup
```
public SortedSet<Route> getRoutesAreBackup()
```
    Returns the routes associated to this demand, but only those that are a backup route.
    
    Important: If network layer routing type is not SOURCE_ROUTING, an exception is thrown.
    
    Returns:
    
    The set of routes
  - getRoutesAreNotBackup
```
public SortedSet<Route> getRoutesAreNotBackup()
```
    Returns the routes associated to this demand, but only those that are not a backup route.
    
    Important: If network layer routing type is not SOURCE_ROUTING, an exception is thrown.
    
    Returns:
    
    The set of routes
  - getRoutesHaveBackup
```
public SortedSet<Route> getRoutesHaveBackup()
```
    Returns the routes associated to this demand, but only those that are have themselves a backup route.
    
    Important: If network layer routing type is not SOURCE_ROUTING, an exception is thrown.
    
    Returns:
    
    The set of routes
  - getRoutesHaveNoBackup
```
public SortedSet<Route> getRoutesHaveNoBackup()
```
    Returns the routes associated to this demand, but only those that have no backup route themselves.
    
    Important: If network layer routing type is not SOURCE_ROUTING, an exception is thrown.
    
    Returns:
    
    The set of routes
  - getRoutingCycleType
```
public Constants.RoutingCycleType getRoutingCycleType()
```
    Returns the routing cycle type of the demand, indicating if the traffic is routed in a loopless form, with open loops or with closed loops (the latter can only happen in HOP_BY_HOP_ROUTING routing).
    
    Returns:
    
    The demand routing cycle type
    
    See Also:
    
    Constants.RoutingCycleType
  - getRoutingType
```
public Constants.RoutingType getRoutingType()
```
    Returns the routing type of the demand.
    
    Returns:
    
    The routing type of the given layer
    
    See Also:
    
    Constants.RoutingType
  - getServiceChainSequenceOfTraversedResourceTypes
```
public List<String> getServiceChainSequenceOfTraversedResourceTypes()
```
    Gets the sequence of types of resources defined (the ones that the routes of this demand have to follow). An empty list is returned if the method setMandatorySequenceOfTraversedResourceTypes was not called never before for this demand.
    
    Returns:
    
    the list
  - getTraversedLinksAndCarriedTraffic
```
public SortedMap<Link,Double> getTraversedLinksAndCarriedTraffic(boolean normalizedToOfferedTraffic)
```
    Returns a map with an entry for each traversed link, and associated to it the demand's traffic carried in that link. If selected by the user, the carried traffic is given as a fraction respect to the demand offered traffic
    
    Parameters:
    
    normalizedToOfferedTraffic - see above
    
    Returns:
    
    see above
  - getWorstCaseLengthInKm
```
public double getWorstCaseLengthInKm()
```
    Returns the worse case end-to-end length in km of the demand traffic. If the routing is source routing, this is the worst length (summing the link lengths in km) for all the routes carrying traffic. If the routing is hop-by-hop and loopless, the paths followed are computed and the worst case length among all the paths is returned. If the hop-by-hop routing has loops, Double.MAX_VALUE is returned. In multilayer design, when the traffic of a demand traverses a link that is coupled to a lower layer demand, the link length taken is the worst case length of the lower layer demand of the underlying demand.
    
    Returns:
    
    see above
  - getWorstCasePropagationTimeInMs
```
public double getWorstCasePropagationTimeInMs()
```
    Returns the worse case end-to-end propagation time of the demand traffic. If the routing is source routing, this is the worse propagation time (summing the link latencies) for all the routes carrying traffic. If the routing is hop-by-hop and loopless, the paths followed are computed and the worse case propagation time is returned. If the hop-by-hop routing has loops, Double.MAX_VALUE is returned. In multilayer design, when the traffic of a demand traverses a link that is coupled to a lower layer demand, the link latency taken is the worse case propagation time of the underlying demand.
    
    Returns:
    
    The worse case propagation time in miliseconds
  - isBidirectional
```
public boolean isBidirectional()
```
    Returns true if the demand is bidirectional. That is, it has an associated demand in the other direction
    
    Returns:
    
    see above
  - isBifurcated
```
public boolean isBifurcated()
```
    If routing is SOURCE_ROUTING, return true if more than one route is associated to this demand (routes down or with zero carried traffic also count).
    
    If routing is HOP_BY_HOP_ROUTING, return true if a node sends traffic of the demand through more than one output link.
    
    Returns:
    
    true if bifurcated, false otherwise
  - isBlocked
```
public boolean isBlocked()
```
    Returns true if the carried traffic is strictly less than the offered traffic, up to the Net2Plan-wide precision factor.
    
    Returns:
    
    true if blocked, false otherwise
    
    See Also:
    
    Configuration
  - isCoupled
```
public boolean isCoupled()
```
    Returns true if the demand is coupled to a link of an upper layer.
    
    Returns:
    
    true is coupled, false otherwise
  - isCoupledInDifferentLayer
```
public boolean isCoupledInDifferentLayer()
```
    Returns true if the demand is coupled to a link in a different layer than the demnad (and thus an *upper* layer) , false otherwise.
    
    Returns:
    
    see above
  - isCoupledInSameLayer
```
public boolean isCoupledInSameLayer()
```
    Returns true if the demand is coupled to a link in the same layer as the demand, false otherwise.
    
    Returns:
    
    see above
  - isServiceChainRequest
```
public boolean isServiceChainRequest()
```
    Returns if the current demand reflects a service chain request, that is, if the routes are constrained to traverse a given sequence of resources of given types.
    
    Returns:
    
    true if the demand defines a service chain request, false otherwise
  - isSourceRouting
```
public boolean isSourceRouting()
```
    Returns true if the routing type in this demand is of the type source routing
    
    Returns:
    
    see above
  - isTraversingOversubscribedLinks
```
public boolean isTraversingOversubscribedLinks()
```
    Returns true if the traffic of the demand is traversing an oversubscribed link, false otherwise.
    
    Returns:
    
    true if the traffic is traversing an oversubscribed link, false otherwise
  - isTraversingOversubscribedResources
```
public boolean isTraversingOversubscribedResources()
```
    Returns true if the traffic of the demand is traversing an oversubscribed resource, false otherwise. If the layer is not in a SOURCE ROUTING mode, an Exception is thrown
    
    Returns:
    
    true if the traffic is traversing an oversubscribed resource, false otherwise
  - remove
```
public void remove()
```
    Removes a demand, and any associated routes or forwarding rules.
  - removeAllForwardingRules
```
public void removeAllForwardingRules()
```
    Removes all forwarding rules associated to the demand.
    
    Important: If routing type is not HOP_BY_HOP_ROUTING and exception is thrown.
  - removeAllRoutes
```
public void removeAllRoutes()
```
    Removes all forwarding rules associated to the demand.
    
    Important: If routing type is not HOP_BY_HOP_ROUTING and exception is thrown.
  - setBidirectionalPair
```
public void setBidirectionalPair(Demand d)
```
    Sets the given demand as the bidirectional pair of this demand. If any of the demands was previously set as bidirectional link of other demand, such relation is removed. The demands must be in the same layer, and have opposite end nodes
    
    Parameters:
    
    d - the other demand
  - setIntendedRecoveryType
```
public void setIntendedRecoveryType(Demand.IntendedRecoveryType recoveryType)
```
    Sets the intended recovery type for this demand
    
    Parameters:
    
    recoveryType - the recovery type
  - setMaximumAcceptableE2EWorstCaseLatencyInMs
```
public void setMaximumAcceptableE2EWorstCaseLatencyInMs(double maxLatencyMs)
```
    Sets the maximum latency in ms acceptable for the demand. A non-positive value is equivalent to no limit
    
    Parameters:
    
    maxLatencyMs - see above
  - setMonitoredOrForecastedOfferedTraffic
```
public void setMonitoredOrForecastedOfferedTraffic(TrafficSeries newTimeSeries)
```
    Sets the new time series for the monitored or forecasted offered traffic, eliminating any previous values
    
    Parameters:
    
    newTimeSeries - see above
  - setOfferedTraffic
```
public void setOfferedTraffic(double offeredTraffic)
```
    Sets the offered traffic by a demand. If routing type is HOP_BY_HOP_ROUTING, the carried traffic for each link is updated according to the forwarding rules. In SOURCE_ROUTING, the routes carried traffic is not updated.
    
    Parameters:
    
    offeredTraffic - The new offered traffic (must be non-negative)
  - setOfferedTrafficPerPeriodGrowthFactor
```
public void setOfferedTrafficPerPeriodGrowthFactor(double growthFactor)
```
    Sets the growth factor of the offered traffic in subsequent periods. Offered traffic in period t+1, is the offered traffic in period t, multiplied by (1+growthFactor)
    
    Parameters:
    
    growthFactor - see above
  - setQoSType
```
public void setQoSType(String newQosType)
```
    Sets the QoS type of the demand. Any previous type is removed.
    
    Parameters:
    
    newQosType - see above
  - setRoutingType
```
public void setRoutingType(Constants.RoutingType newRoutingType)
```
    Sets the routing type at the given layer. If there is some previous routing information, it will be converted to the new type. If no layer is provided, default layer is assumed. In the conversion from HOP-BY-HOP to SOURCE-ROUTING: (i) the demands with open loops are routed so these loops are removed, and the resulting routing consumes the same or less bandwidth in the demand traversed links, (ii) the demands with closed loops are routed so that the traffic that enters the closed loops is not carried. These modifications are done since open or close loops would require routes with an infinite number of links to be fairly represented.
    
    In the conversion to HOP-BY-HOP: An exception is thrown if a demand is service chain demand (since this information would be lost in the hop-by-bop representation). Also, in this conversion, some information can be lost (so a conversion back to SOURCE ROUTING will not produce the original network): the conversion uses the route carried traffics, and discards the information of the the routes occupied capacities in the links. A conversion back will put all the occupied capacities of the routes, equal to the carried traffics (so the original occupied links capacities would be lost, if different).
    
    Parameters:
    
    newRoutingType - RoutingType
  - setServiceChainSequenceOfTraversedResourceTypes
```
public void setServiceChainSequenceOfTraversedResourceTypes(List<String> resourceTypesSequence)
```
    Sets the sequence of types of resources that the routes of this demand have to follow. This method is to make the demand become a request of service chains. This method can only be called if the routing type is SOURCE ROUTING, and the demand has no routes at the moment.
    
    Parameters:
    
    resourceTypesSequence - the sequence of types of the resources that has to be traversed by all the routes of this demand. If null, an empty sequence is assumed
  - toString
```
public String toString()
```
    Returns a String representation of the demand.
    
    Overrides:
    
    toString in class NetworkElement
    
    Returns:
    
    String representation of the demand

Class Demand

Nested Class Summary

Method Summary

Methods inherited from class com.net2plan.interfaces.networkDesign.NetworkElement

Methods inherited from class java.lang.Object

Method Detail

checkRoutingType

computeMinimumCostServiceChains

computeShortestPathRoutes

coupleToNewLinkCreated

coupleToUpperOrSameLayerLink

createBidirectionalPair

decouple

getBidirectionalPair

getBlockedTraffic

getCarriedTraffic

getCoupledLink

getEgressNode

getEndNodes

getForwardingRules

getIngressNode

getIntendedRecoveryType

getLayer

getLinksNoDownPropagationPotentiallyCarryingTraffic

getLinksWithNonZeroForwardingRules

getMaximumAcceptableE2EWorstCaseLatencyInMs

getMonitoredOrForecastedOfferedTraffic

getOccupiedCapacity

getOfferedTraffic

getOfferedTrafficPerPeriodGrowthFactor

getQosType

getRoutes

getRoutesAreBackup

getRoutesAreNotBackup

getRoutesHaveBackup

getRoutesHaveNoBackup

getRoutingCycleType

getRoutingType

getServiceChainSequenceOfTraversedResourceTypes

getTraversedLinksAndCarriedTraffic

getWorstCaseLengthInKm

getWorstCasePropagationTimeInMs

isBidirectional

isBifurcated

isBlocked

isCoupled

isCoupledInDifferentLayer

isCoupledInSameLayer

isServiceChainRequest

isSourceRouting

isTraversingOversubscribedLinks

isTraversingOversubscribedResources

remove

removeAllForwardingRules

removeAllRoutes

setBidirectionalPair

setIntendedRecoveryType

setMaximumAcceptableE2EWorstCaseLatencyInMs

setMonitoredOrForecastedOfferedTraffic

setOfferedTraffic

setOfferedTrafficPerPeriodGrowthFactor

setQoSType

setRoutingType

setServiceChainSequenceOfTraversedResourceTypes

toString