Link (net2plan-javadoc 0.6.0.1 API)

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

All Implemented Interfaces:

Comparable<NetworkElement>
```
public class Link
extends NetworkElement
```
This class contains a representation of a link. A link is characterized by its initial and end node, the network layer it belongs to, and its capacity, measured in the layer link capacity units. When the routing type at the link layer is SOURCE_ROUTING, the link carries traffic of the traversing routes, and can have some capacity reserved by protection segments. If the routing type is HOP_BY_HOP_ROUTING, the link carried traffic depends on the demands offered traffic and the forwarding rules. In both routing types, links can be part of multicast trees and carry their traffic.
- A link has a length in km and a propagation speed (km/sec). Both determine its propagation latency.
- A link can belong to one or more shared risk groups (SRG).
- A link can be up or down. If a link is down, the carried traffic of all its traversing routes and segments is set to zero (SOURCE_ROUTING), the splitting factors of the forwarding rules through it are set to zero (HOP_BY_HOP_ROUTING), and the carried traffic of any traversing multicast tree is set to zero.
- A link can be coupled to a lower layer unicast demand, a lower layer multicast demand, or none. If coupled, the link capacity is made equal to the demand (unicast or multicast) carried traffic. The link capacity and the demand traffic must be measured in the same units
Since:

0.4.0

Author:

Pablo Pavon-Marino

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`void`	`coupleToLowerLayerDemand(Demand demand)` Couples the link to a unicast `Demand` in the lower layer.
`Demand`	`coupleToNewDemandCreated(NetworkLayer newDemandLayer, Constants.RoutingType routingTypeDemand)` Creates a new `Demand` in the given layer, with same end nodes as the link, and then couples the link to the new created demand.
`Link`	`createBidirectionalPair()` Creates a link in the opposite direction as this, and with the same attributes, and associate both as bidirectional pairs.
`void`	`decouple()`
`Link`	`getBidirectionalPair()` If the link was added using addLinkBidirectional() returns the link in the opposite direction (if it was not previously removed).
`double`	`getCapacity()` Returns the link capacity.
`double`	`getCarriedTraffic()` Returns the link carried traffic (in traffic demand units).
`Demand`	`getCoupledDemand()` Returns the unicast `Demand` the link is coupled to, or `null` if none.
`MulticastDemand`	`getCoupledMulticastDemand()` Returns the `MulticastDemand` the link is coupled to, or `null` if none.
`Triple<SortedSet<Demand>,SortedSet<Demand>,SortedSet<MulticastDemand>>`	`getDemandsPotentiallyTraversingThisLink()` Returns the set of demands that could potentially put traffic in this link, according to the routes/forwarding rules defined.
`SortedSet<Demand>`	`getDemandsWithNonZeroForwardingRules()` Returns the set of demands in this layer, with non zero forwarding rules defined for them in this link.
`Node`	`getDestinationNode()` Returns the link destination `Node`.
`SortedMap<Pair<Demand,Link>,Double>`	`getForwardingRules()` Returns the non zero forwarding rules that are defined in the link.
`NetworkLayer`	`getLayer()` Returns the `NetworkLayer` the link belongs to.
`double`	`getLengthInKm()` Returns the link length in km.
`Triple<SortedMap<Demand,SortedSet<Link>>,SortedMap<Demand,SortedSet<Link>>,SortedMap<Pair<MulticastDemand,Node>,SortedSet<Link>>>`	`getLinksDownPropagationPotentiallyCarryingTrafficTraversingThisLink()` Returns the set of links in lower layers carry the traffic that traverses this link, before and after traversing it, according to the routes/forwarding rules defined.
`Triple<SortedMap<Demand,SortedSet<Link>>,SortedMap<Demand,SortedSet<Link>>,SortedMap<Pair<MulticastDemand,Node>,SortedSet<Link>>>`	`getLinksThisLayerPotentiallyCarryingTrafficTraversingThisLink()` Returns the set of links in this layer (including this) that carry the traffic that traverses this link, before and after traversing it, according to the routes/forwarding rules defined.
`TrafficSeries`	`getMonitoredOrForecastedCarriedTraffic()` Returns the object contianing the monitored or forecasted time series information for the carried traffic
`double`	`getMulticastCarriedTraffic()` Returns the sum of the traffic carried by the `MulticastTree` traversing the link.
`double`	`getMulticastOccupiedLinkCapacity()` Returns the sum of the occupied link capacity by the traffic of the `Multicast Trees` traversing the link.
`int`	`getNumberOfForwardingRules()` Returns the number of forwarding rules defined for this link (with non-zero split factor)
`int`	`getNumberOfTraversingBackupRoutes()` Returns the set number of routes traversing the link that are designated as backup of other route
`int`	`getNumberOfTraversingRoutes()` Returns the number of routes traversing this link.
`int`	`getNumberOfTraversingTrees()` Returns the number of multicast trees traversing this link
`double`	`getOccupiedCapacity()` Returns the link occupied capacity (in link capacity units).
`double`	`getOccupiedCapacityFromDemand(Demand d)`
`double`	`getOccupiedCapacityOnlyBackupRoutes()` Returns the link occupied capacity (in link capacity units).
`Node`	`getOriginNode()` Returns the link origin node.
`double`	`getOversubscribedTraffic()` Returns the amount of traffic over the link capacity.
`SortedMap<String,Pair<Double,Double>>`	`getPerQoSOccupationAndQosViolationMap()` Returns for each traversing demand, a pair with i) the occupied capacity in the link of that demand, ii) the amount of such occupied capacity that is violating the demand QoS assigned capacity.
`double`	`getPropagationDelayInMs()` Returns the link propagation delay in miliseconds.
`double`	`getPropagationSpeedInKmPerSecond()` Returns the link propagation speed in km per second.
`Pair<Double,Double>`	`getQosOccupationAndQosViolation(String qosType)` Returns the total traffic occupied in the link by the demands of a given QoS type, and the amount out of that traffic that is violating the QoS
`Pair<Integer,Double>`	`getQosTypePriorityAndMaxLinkUtilization(String qosType)` Returns the priority (lower better) and link percentage maximum utilization, assigned to the QoS type indicated.
`SortedMap<String,Pair<Integer,Double>>`	`getQosTypePriorityAndMaxLinkUtilizationMap()` Returns the priority (lower better) and link percentage maximum utilization, assigned to the QoS type indicated, for each of the QoS types with traffic traversing the link.
`SortedSet<String>`	`getQosViolated()` Returns the set of QoS types that have violated traffic in this link
`SortedSet<SharedRiskGroup>`	`getSRGs()` Returns the Shared Risk Groups (`SRGs`) the link belongs to.
`SortedSet<Route>`	`getTraversingBackupRoutes()` Returns the set of routes traversing the link that are designated as backup of other route
`SortedSet<Route>`	`getTraversingRoutes()` Returns the `Routes` traversing the link.
`SortedMap<Route,Integer>`	`getTraversingRoutesAndMultiplicity()` Returns a map with the routes traversing this link, and the number of times they traverse it
`SortedSet<MulticastTree>`	`getTraversingTrees()` Returns the `Multicast Trees` traversing the link.
`double`	`getUtilization()` Returns the link utilization, measured as the ratio between the total occupied capacity in the link and the total link capacity.
`boolean`	`isBidirectional()` Returns true if the link is bidirectional.
`boolean`	`isCoupled()` Returns `True` if the link is coupled to a `Demand` from other layer, `false` otherwise.
`boolean`	`isCoupledInDifferentLayer()` Returns `true` if the link is coupled to a demand in a different layer than the demnad (and thus an upper layer) , false otherwise.
`boolean`	`isCoupledInSameLayer()` Returns `true` if the link is coupled to a demand in the same layer as the demand, false otherwise.
`boolean`	`isDown()` Returns whether the link is down (in failure) or not.
`boolean`	`isOversubscribed()` Returns true if the link is oversubscribed, up to the Net2Plan defined precision factor.
`boolean`	`isQoSViolated(String qosType)` Returns true if the traffic of the given QoS is violating the QoS in the link
`boolean`	`isUp()` Returns whether the link is up (not in failure) or down.
`void`	`remove()` Removes the link.
`void`	`removeAllForwardingRules()` Removes all forwarding rules associated to the link.
`void`	`removeQosTypePriorityAndMaxLinkUtilization(String qosType)` Removes any information on the priority (lower better) and link percentage maximum utilization, assigned to the QoS type indicated.
`void`	`setBidirectionalPair(Link e)` Sets the given link as the bidirectional pair of this link.
`void`	`setCapacity(double newLinkCapacity)` Sets the link capacity.
`boolean`	`setFailureState(boolean setAsUp)` Sets the failure state of the link: up or down and returns the previous failure state.
`void`	`setLengthInKm(double lengthInKm)` Sets the link length in km.
`void`	`setMonitoredOrForecastedCarriedTraffic(TrafficSeries newTimeSeries)` Sets the new time series for the monitored or forecasted offered traffic, eliminating any previous values
`void`	`setPropagationSpeedInKmPerSecond(double speed)` Sets the link propagation speed in km per second.
`void`	`setQosTypePriorityAndMaxLinkUtilization(String qosType, int priority, double maxLinkUtilization)` Sets the priority (lower better) and link percentage maximum utilization, assigned to the QoS type indicated.
`String`	`toString()` Returns a `String` representation of the link.

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

- Method Detail
  - coupleToLowerLayerDemand
```
public void coupleToLowerLayerDemand(Demand demand)
```
    Couples the link to a unicast Demand in the lower layer.
    
    Parameters:
    
    demand - The demand to be coupled to
  - coupleToNewDemandCreated
```
public Demand coupleToNewDemandCreated(NetworkLayer newDemandLayer,
                                       Constants.RoutingType routingTypeDemand)
```
    Creates a new Demand in the given layer, with same end nodes as the link, and then couples the link to the new created demand.
    
    Parameters:
    
    newDemandLayer - The layer where the demand will be created (and coupled to the link)
    
    routingTypeDemand - Routing type
    
    Returns:
    
    The created demand
  - createBidirectionalPair
```
public Link createBidirectionalPair()
```
    Creates a link in the opposite direction as this, and with the same attributes, and associate both as bidirectional pairs. If this link is already a bidirectional link, makes nothing and returns null
    
    Returns:
    
    the newly created link
  - decouple
```
public void decouple()
```
  - getBidirectionalPair
```
public Link getBidirectionalPair()
```
    If the link was added using addLinkBidirectional() returns the link in the opposite direction (if it was not previously removed). Returns null otherwise.
    
    Returns:
    
    The link in the opposite direction, or null if none
  - getCapacity
```
public double getCapacity()
```
    Returns the link capacity.
    
    Returns:
    
    The link capacity
  - getCarriedTraffic
```
public double getCarriedTraffic()
```
    Returns the link carried traffic (in traffic demand units).
    
    Returns:
    
    The carried traffic
  - getCoupledDemand
```
public Demand getCoupledDemand()
```
    Returns the unicast Demand the link is coupled to, or null if none.
    
    Returns:
    
    The coupled demand (or null
  - getCoupledMulticastDemand
```
public MulticastDemand getCoupledMulticastDemand()
```
    Returns the MulticastDemand the link is coupled to, or null if none.
    
    Returns:
    
    The coupled multicast demand (or null
  - getDemandsPotentiallyTraversingThisLink
```
public Triple<SortedSet<Demand>,SortedSet<Demand>,SortedSet<MulticastDemand>> getDemandsPotentiallyTraversingThisLink()
```
    Returns the set of demands that could potentially put traffic in this link, according to the routes/forwarding rules defined. 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 demands with zero offered traffic are also included. All the links are considered primary. The method returns three set: (i) demands putting traffic in primary routes (or hop-by-hop routing), (ii) in source routing, demands with backup routes traversing this link, (iii) multicast demands with trees traversing this link
    
    Returns:
    
    see above
  - getDemandsWithNonZeroForwardingRules
```
public SortedSet<Demand> getDemandsWithNonZeroForwardingRules()
```
    Returns the set of demands in this layer, with non zero forwarding rules defined for them in this link. The link may or may not carry traffic, and may be or not be failed.
    
    Returns:
    
    see above
  - getDestinationNode
```
public Node getDestinationNode()
```
    Returns the link destination Node.
    
    Returns:
    
    The destination node
  - getForwardingRules
```
public SortedMap<Pair<Demand,Link>,Double> getForwardingRules()
```
    Returns the non zero forwarding rules that are defined in the link. If the routing type of the layer where the link is attached is not HOP_BY_HOP_ROUTING an exception is thrown.
    
    Returns:
    
    SortedMap of demand-link pairs, associated to [0,1] splitting factors
  - getLayer
```
public NetworkLayer getLayer()
```
    Returns the NetworkLayer the link belongs to.
    
    Returns:
    
    The layer
  - getLengthInKm
```
public double getLengthInKm()
```
    Returns the link length in km.
    
    Returns:
    
    The link length in km
  - getLinksDownPropagationPotentiallyCarryingTrafficTraversingThisLink
```
public Triple<SortedMap<Demand,SortedSet<Link>>,SortedMap<Demand,SortedSet<Link>>,SortedMap<Pair<MulticastDemand,Node>,SortedSet<Link>>> getLinksDownPropagationPotentiallyCarryingTrafficTraversingThisLink()
```
    Returns the set of links in lower layers carry the traffic that traverses this link, before and after traversing it, according to the routes/forwarding rules defined. 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. All the links are considered primary. The method returns three maps: (i) first map, with one entry per demand whose traffic traverses this node, associated to the other links (aside of this) that this link traffic also traverses, but are not part of backup routes, (ii) second map, the same as before, but only links belonging to backup routes, (iii) other links with multicast trees that traverse this node, being a key its associated multicast demands.
    Note: this link is not included in any set an any map
    capacity in it
    
    Returns:
    
    see above
  - getLinksThisLayerPotentiallyCarryingTrafficTraversingThisLink
```
public Triple<SortedMap<Demand,SortedSet<Link>>,SortedMap<Demand,SortedSet<Link>>,SortedMap<Pair<MulticastDemand,Node>,SortedSet<Link>>> getLinksThisLayerPotentiallyCarryingTrafficTraversingThisLink()
```
    Returns the set of links in this layer (including this) that carry the traffic that traverses this link, before and after traversing it, according to the routes/forwarding rules defined. 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. All the links are considered primary. The method returns three maps: (i) first map, with one entry per demand whose traffic traverses this node, associated to the other links (aside of this) that this link traffic also traverses, but are not part of backup routes, (ii) second map, the same as before, but only links belonging to backup routes, (iii) other links with multicast trees that traverse this node, being a key its associated multicast demands.
    
    Returns:
    
    see above
  - getMonitoredOrForecastedCarriedTraffic
```
public TrafficSeries getMonitoredOrForecastedCarriedTraffic()
```
    Returns the object contianing the monitored or forecasted time series information for the carried traffic
    
    Returns:
    
    see above
  - getMulticastCarriedTraffic
```
public double getMulticastCarriedTraffic()
```
    Returns the sum of the traffic carried by the MulticastTree traversing the link.
    
    Returns:
    
    The carried traffic (in traffic units)
  - getMulticastOccupiedLinkCapacity
```
public double getMulticastOccupiedLinkCapacity()
```
    Returns the sum of the occupied link capacity by the traffic of the Multicast Trees traversing the link.
    
    Returns:
    
    The occupied link capacity (link capacity units)
  - getNumberOfForwardingRules
```
public int getNumberOfForwardingRules()
```
    Returns the number of forwarding rules defined for this link (with non-zero split factor)
    
    Returns:
    
    see above
  - getNumberOfTraversingBackupRoutes
```
public int getNumberOfTraversingBackupRoutes()
```
    Returns the set number of routes traversing the link that are designated as backup of other route
    
    Returns:
    
    see above
  - getNumberOfTraversingRoutes
```
public int getNumberOfTraversingRoutes()
```
    Returns the number of routes traversing this link.
    
    Returns:
    
    see above
  - getNumberOfTraversingTrees
```
public int getNumberOfTraversingTrees()
```
    Returns the number of multicast trees traversing this link
    
    Returns:
    
    see above
  - getOccupiedCapacity
```
public double getOccupiedCapacity()
```
    Returns the link occupied capacity (in link capacity units).
    
    Returns:
    
    The occupied capacity as described above
  - getOccupiedCapacityFromDemand
```
public double getOccupiedCapacityFromDemand(Demand d)
```
  - getOccupiedCapacityOnlyBackupRoutes
```
public double getOccupiedCapacityOnlyBackupRoutes()
```
    Returns the link occupied capacity (in link capacity units).
    
    Returns:
    
    The occupied capacity as described above
  - getOriginNode
```
public Node getOriginNode()
```
    Returns the link origin node.
    
    Returns:
    
    The origin node
  - getOversubscribedTraffic
```
public double getOversubscribedTraffic()
```
    Returns the amount of traffic over the link capacity.
    
    Returns:
    
    True if oversubscribed, false otherwise
    
    See Also:
    
    Configuration
  - getPerQoSOccupationAndQosViolationMap
```
public SortedMap<String,Pair<Double,Double>> getPerQoSOccupationAndQosViolationMap()
```
    Returns for each traversing demand, a pair with i) the occupied capacity in the link of that demand, ii) the amount of such occupied capacity that is violating the demand QoS assigned capacity. Demands with zero traffic in the link (and thus zero QoS violation), may not appear in the map
    
    Returns:
    
    see above
  - getPropagationDelayInMs
```
public double getPropagationDelayInMs()
```
    Returns the link propagation delay in miliseconds.
    
    Returns:
    
    The propagation delay in miliseconds
  - getPropagationSpeedInKmPerSecond
```
public double getPropagationSpeedInKmPerSecond()
```
    Returns the link propagation speed in km per second.
    
    Returns:
    
    The link propagation speed in km per second
  - getQosOccupationAndQosViolation
```
public Pair<Double,Double> getQosOccupationAndQosViolation(String qosType)
```
    Returns the total traffic occupied in the link by the demands of a given QoS type, and the amount out of that traffic that is violating the QoS
    
    Parameters:
    
    qosType - see above
    
    Returns:
    
    see above
  - getQosTypePriorityAndMaxLinkUtilization
```
public Pair<Integer,Double> getQosTypePriorityAndMaxLinkUtilization(String qosType)
```
    Returns the priority (lower better) and link percentage maximum utilization, assigned to the QoS type indicated. If none information was defined, the worst priority Integer.MAX_VALUE and the a link utilization of 100% is returned
    
    Parameters:
    
    qosType - see above
    
    Returns:
    
    see above
  - getQosTypePriorityAndMaxLinkUtilizationMap
```
public SortedMap<String,Pair<Integer,Double>> getQosTypePriorityAndMaxLinkUtilizationMap()
```
    Returns the priority (lower better) and link percentage maximum utilization, assigned to the QoS type indicated, for each of the QoS types with traffic traversing the link.
    
    Returns:
    
    see above
  - getQosViolated
```
public SortedSet<String> getQosViolated()
```
    Returns the set of QoS types that have violated traffic in this link
    
    Returns:
    
    see above
  - getSRGs
```
public SortedSet<SharedRiskGroup> getSRGs()
```
    Returns the Shared Risk Groups (SRGs) the link belongs to. The link fails when any of these SRGs is down.
    
    Returns:
    
    the set of SRGs
  - getTraversingBackupRoutes
```
public SortedSet<Route> getTraversingBackupRoutes()
```
    Returns the set of routes traversing the link that are designated as backup of other route
    
    Returns:
    
    see above
  - getTraversingRoutes
```
public SortedSet<Route> getTraversingRoutes()
```
    Returns the Routes traversing the link. If network layer routing type is not SOURCE_ROUTING, an exception is thrown.
    
    Returns:
    
    An unmodifiable SortedSet of traversing routes. If no routes exist, an empty SortedSet is returned
  - getTraversingRoutesAndMultiplicity
```
public SortedMap<Route,Integer> getTraversingRoutesAndMultiplicity()
```
    Returns a map with the routes traversing this link, and the number of times they traverse it
    
    Returns:
    
    see above
  - getTraversingTrees
```
public SortedSet<MulticastTree> getTraversingTrees()
```
    Returns the Multicast Trees traversing the link.
    
    Returns:
    
    An unmodifiable SortedSet of traversing multicast trees. If no tree exists, an empty set is returned
  - getUtilization
```
public double getUtilization()
```
    Returns the link utilization, measured as the ratio between the total occupied capacity in the link and the total link capacity.
    
    Returns:
    
    The utilization as described above. If the link has zero capacity and strictly positive occupied capacity, Double.POSITIVE_INFINITY is returned
  - isBidirectional
```
public boolean isBidirectional()
```
    Returns true if the link is bidirectional. That is, it has an associated link in the other direction
    
    Returns:
    
    see above
  - isCoupled
```
public boolean isCoupled()
```
    Returns True if the link is coupled to a Demand from other layer, false otherwise.
    
    Returns:
    
    True if the link is coupled, false otherwise
  - isCoupledInDifferentLayer
```
public boolean isCoupledInDifferentLayer()
```
    Returns true if the link is coupled to a demand 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 link is coupled to a demand in the same layer as the demand, false otherwise.
    
    Returns:
    
    see above
  - isDown
```
public boolean isDown()
```
    Returns whether the link is down (in failure) or not.
    
    Returns:
    
    True if down, false if up
  - isOversubscribed
```
public boolean isOversubscribed()
```
    Returns true if the link is oversubscribed, up to the Net2Plan defined precision factor. That is, if the occupied capacity by the traversing traffic exceeds the link capacity plus said precision factor. In SOURCE_ROUTING, the link capacity includes any reserved capacity, and the occupied link capacity includes that from the traversing routes and protection segments.
    
    Returns:
    
    True if oversubscribed, false otherwise
    
    See Also:
    
    Configuration
  - isQoSViolated
```
public boolean isQoSViolated(String qosType)
```
    Returns true if the traffic of the given QoS is violating the QoS in the link
    
    Parameters:
    
    qosType - see above
    
    Returns:
    
    see above
  - isUp
```
public boolean isUp()
```
    Returns whether the link is up (not in failure) or down.
    
    Returns:
    
    true if up, false if down
  - remove
```
public void remove()
```
    Removes the link. The routing is updated removing any associated routes, protection segments, multicast trees or forwarding rules.
    
    If the link is coupled to a unicast or multicast demand, it is first decoupled. In the multicast case, this means that the multicast demand is decoupled from ALL the links it is coupled to.
  - removeAllForwardingRules
```
public void removeAllForwardingRules()
```
    Removes all forwarding rules associated to the link.
    
    If routing type is not HOP_BY_HOP_ROUTING, an exeception is thrown.
  - removeQosTypePriorityAndMaxLinkUtilization
```
public void removeQosTypePriorityAndMaxLinkUtilization(String qosType)
```
    Removes any information on the priority (lower better) and link percentage maximum utilization, assigned to the QoS type indicated.
    
    Parameters:
    
    qosType - see above
  - setBidirectionalPair
```
public void setBidirectionalPair(Link e)
```
    Sets the given link as the bidirectional pair of this link. If any of the links was previously set as bidirectional link of other link, such relation is removed. The links must bein the same layer, and have opposite end nodes
    
    Parameters:
    
    e - the other link
  - setCapacity
```
public void setCapacity(double newLinkCapacity)
```
    Sets the link capacity.
    
    Parameters:
    
    newLinkCapacity - The link capacity (must be non-negative)
  - setFailureState
```
public boolean setFailureState(boolean setAsUp)
```
    Sets the failure state of the link: up or down and returns the previous failure state. The routing is updated if the failure state changed.
    
    Parameters:
    
    setAsUp - The new failure state: true if up, false if down
    
    Returns:
    
    the previous failure state
  - setLengthInKm
```
public void setLengthInKm(double lengthInKm)
```
    Sets the link length in km.
    
    Parameters:
    
    lengthInKm - New link length in km (must be non-negative)
  - setMonitoredOrForecastedCarriedTraffic
```
public void setMonitoredOrForecastedCarriedTraffic(TrafficSeries newTimeSeries)
```
    Sets the new time series for the monitored or forecasted offered traffic, eliminating any previous values
    
    Parameters:
    
    newTimeSeries - see above
  - setPropagationSpeedInKmPerSecond
```
public void setPropagationSpeedInKmPerSecond(double speed)
```
    Sets the link propagation speed in km per second.
    
    Parameters:
    
    speed - The speed in km per second
  - setQosTypePriorityAndMaxLinkUtilization
```
public void setQosTypePriorityAndMaxLinkUtilization(String qosType,
                                                    int priority,
                                                    double maxLinkUtilization)
```
    Sets the priority (lower better) and link percentage maximum utilization, assigned to the QoS type indicated.
    
    Parameters:
    
    qosType - see above
    
    priority - see above
    
    maxLinkUtilization - must be between zero and 1
  - toString
```
public String toString()
```
    Returns a String representation of the link.
    
    Overrides:
    
    toString in class NetworkElement
    
    Returns:
    
    String representation of the link

Class Link

Method Summary

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

Methods inherited from class java.lang.Object

Method Detail

coupleToLowerLayerDemand

coupleToNewDemandCreated

createBidirectionalPair

decouple

getBidirectionalPair

getCapacity

getCarriedTraffic

getCoupledDemand

getCoupledMulticastDemand

getDemandsPotentiallyTraversingThisLink

getDemandsWithNonZeroForwardingRules

getDestinationNode

getForwardingRules

getLayer

getLengthInKm

getLinksDownPropagationPotentiallyCarryingTrafficTraversingThisLink

getLinksThisLayerPotentiallyCarryingTrafficTraversingThisLink

getMonitoredOrForecastedCarriedTraffic

getMulticastCarriedTraffic

getMulticastOccupiedLinkCapacity

getNumberOfForwardingRules

getNumberOfTraversingBackupRoutes

getNumberOfTraversingRoutes

getNumberOfTraversingTrees

getOccupiedCapacity

getOccupiedCapacityFromDemand

getOccupiedCapacityOnlyBackupRoutes

getOriginNode

getOversubscribedTraffic

getPerQoSOccupationAndQosViolationMap

getPropagationDelayInMs

getPropagationSpeedInKmPerSecond

getQosOccupationAndQosViolation

getQosTypePriorityAndMaxLinkUtilization

getQosTypePriorityAndMaxLinkUtilizationMap

getQosViolated

getSRGs

getTraversingBackupRoutes

getTraversingRoutes

getTraversingRoutesAndMultiplicity

getTraversingTrees

getUtilization

isBidirectional

isCoupled

isCoupledInDifferentLayer

isCoupledInSameLayer

isDown

isOversubscribed

isQoSViolated

isUp

remove

removeAllForwardingRules

removeQosTypePriorityAndMaxLinkUtilization

setBidirectionalPair

setCapacity

setFailureState

setLengthInKm

setMonitoredOrForecastedCarriedTraffic

setPropagationSpeedInKmPerSecond

setQosTypePriorityAndMaxLinkUtilization

toString