public class Offline_cba_wirelessCongControlTransmissionPowerAssignment extends Object implements com.net2plan.interfaces.networkDesign.IAlgorithm
Given a wireless network where each link capacity is determined by the link SNR (signal to noise ratio - incliding interferences), and given a set of unicast traffic demands defined in it. This algorithm first computes one shortest path route per demand, which will carry the demand traffic. Then, jointly optimizes (i) the traffic to inject by each demand, and (ii) the transmission power in the wireless links, to optimize a fair allocation of the traffic among the sources (demands). The link capacity is approximated as proportional to the logarithm of the link SNR. Initially, the input network interference matrix is normalized so that the worst case rise-over-thermal (ROT) of any link matches a given value. The solution is found solving a problem formulation with JOM. |
|
Constructor and Description |
---|
Offline_cba_wirelessCongControlTransmissionPowerAssignment() |
Modifier and Type | Method and Description |
---|---|
String |
executeAlgorithm(com.net2plan.interfaces.networkDesign.NetPlan netPlan,
Map<String,String> algorithmParameters,
Map<String,String> net2planParameters) |
String |
getDescription() |
List<com.net2plan.utils.Triple<String,String,String>> |
getParameters() |
public Offline_cba_wirelessCongControlTransmissionPowerAssignment()
public String executeAlgorithm(com.net2plan.interfaces.networkDesign.NetPlan netPlan, Map<String,String> algorithmParameters, Map<String,String> net2planParameters)
executeAlgorithm
in interface com.net2plan.interfaces.networkDesign.IAlgorithm
public String getDescription()
getDescription
in interface com.net2plan.interfaces.networkDesign.IAlgorithm
getDescription
in interface com.net2plan.internal.IExternal
public List<com.net2plan.utils.Triple<String,String,String>> getParameters()
getParameters
in interface com.net2plan.interfaces.networkDesign.IAlgorithm
getParameters
in interface com.net2plan.internal.IExternal
Copyright © 2018. All rights reserved.