本文整理汇总了Java中vnreal.algorithms.linkmapping.PathSplittingVirtualLinkMapping类的典型用法代码示例。如果您正苦于以下问题：Java PathSplittingVirtualLinkMapping类的具体用法？Java PathSplittingVirtualLinkMapping怎么用？Java PathSplittingVirtualLinkMapping使用的例子？那么, 这里精选的类代码示例或许可以为您提供帮助。
PathSplittingVirtualLinkMapping类属于vnreal.algorithms.linkmapping包，在下文中一共展示了PathSplittingVirtualLinkMapping类的7个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: NodeRanking
import vnreal.algorithms.linkmapping.PathSplittingVirtualLinkMapping; //导入依赖的package包/类
public NodeRanking(AlgorithmParameter param) {
boolean nodeOverload = param.getBoolean("overload", DEFAULT_OVERLOAD);
int distance = param.getInteger("distance", DEFAULT_DIST);
double epsilon = param.getDouble("epsilon", DEFAULT_EPSILON);
this.nodeMappingAlgorithm = new NodeRankingBasedAlgorithm(nodeOverload, epsilon, distance);
if (param.getBoolean("PathSplitting", DEFAULT_PS)) {
double weightCpu = param.getDouble("weightCpu", DEFAULT_WCPU);
double weightBw = param.getDouble("weightBw", DEFAULT_WBW);
this.linkMappingAlgorithm = new PathSplittingVirtualLinkMapping(weightCpu, weightBw);
} else {
int k = param.getInteger("kShortestPath", DEFAULT_KSP);
boolean eppstein = param.getBoolean("eppstein", DEFAULT_EPPSTEIN);
this.linkMappingAlgorithm = new kShortestPathLinkMapping(k, eppstein);
}
}
示例2: AvailableResources
import vnreal.algorithms.linkmapping.PathSplittingVirtualLinkMapping; //导入依赖的package包/类
/**
* Constructor of the algorithm
*
* @param AlgorithmParameter Accepts settings for: <br />
* "distance" (int) - The maximum distance within which to search for substrate nodes
* (set to a negative value to disable) <br />
* "overload" (boolean) - Indicate, whether a substrate node may host more than one
* node of each VirtualNetwork <br />
* "PathSplitting" (boolean) - Indicate, whether link mapping should allow virtual
* links to be split over several paths <br />
* "weightCpu" (double) - The weight of CPU resources <br />
* "weightBw" (double) - The weight of BW resources <br />
* "kShortestPath" (int) - The number k of shortest paths to compute
*
*/
public AvailableResources(AlgorithmParameter param) {
int distance = param.getInteger("distance", DEFAULT_DIST);
boolean nodeOverload = param.getBoolean("overload", DEFAULT_OVERLOAD);
this.nodeMappingAlgorithm = new AvailableResourcesNodeMapping(distance, nodeOverload);
if (param.getBoolean("PathSplitting", DEFAULT_PS)) {
double weightCpu = param.getDouble("weightCpu", DEFAULT_WCPU);
double weightBw = param.getDouble("weightBw", DEFAULT_WBW);
this.linkMappingAlgorithm = new PathSplittingVirtualLinkMapping(weightCpu, weightBw);
} else {
int k = param.getInteger("kShortestPath", DEFAULT_KSP);
boolean eppstein = param.getBoolean("eppstein", DEFAULT_EPPSTEIN);
this.linkMappingAlgorithm = new kShortestPathLinkMapping(k, eppstein);
}
}
示例3: CoordinatedMappingPathSplitting
import vnreal.algorithms.linkmapping.PathSplittingVirtualLinkMapping; //导入依赖的package包/类
public CoordinatedMappingPathSplitting(NetworkStack stack, int dist,
double wCpu, double wBw, int type, boolean nodeOverload) {
super(MiscelFunctions.sortByRevenues(stack),
new CoordinatedVirtualNodeMapping(stack.getSubstrate(), dist,
wCpu, wBw, type, nodeOverload),
new PathSplittingVirtualLinkMapping(stack.getSubstrate(), wCpu,
wBw));
}
示例4: AvailableResourcesPathSplitting
import vnreal.algorithms.linkmapping.PathSplittingVirtualLinkMapping; //导入依赖的package包/类
public AvailableResourcesPathSplitting(NetworkStack stack,
double weightCpu, double weightBw, int distance,
boolean isDistance, boolean nodeOverload) {
super(MiscelFunctions.sortByRevenues(stack),
new AvailableResourcesNodeMapping(stack.getSubstrate(),
distance, isDistance, nodeOverload),
new PathSplittingVirtualLinkMapping(stack.getSubstrate(),
weightCpu, weightBw));
}
示例5: NodeRankingPathSplitting
import vnreal.algorithms.linkmapping.PathSplittingVirtualLinkMapping; //导入依赖的package包/类
public NodeRankingPathSplitting(NetworkStack stack, double weightCpu,
double weightBw, int distance, boolean isDistance,
boolean nodeOverload) {
super(MiscelFunctions.sortByRevenues(stack),
new NodeRankingBasedAlgorithm(stack.getSubstrate(),
nodeOverload, 0.0001, isDistance, distance),
new PathSplittingVirtualLinkMapping(stack.getSubstrate(),
weightCpu, weightBw));
}
示例6: CoordinatedMappingPathSplitting
import vnreal.algorithms.linkmapping.PathSplittingVirtualLinkMapping; //导入依赖的package包/类
public CoordinatedMappingPathSplitting(NetworkStack stack, int dist,
double wCpu, double wBw, int type, boolean nodeOverload) {
super(MiscelFunctions.sortByRevenues(stack),
new CoordinatedVirtualNodeMapping(stack.getSubstrate(), dist,
wCpu, wBw, type, nodeOverload),
new PathSplittingVirtualLinkMapping(stack.getSubstrate(), wCpu,
wBw));
}
示例7: AvailableResourcesPathSplitting
import vnreal.algorithms.linkmapping.PathSplittingVirtualLinkMapping; //导入依赖的package包/类
public AvailableResourcesPathSplitting(NetworkStack stack,
double weightCpu, double weightBw, int distance,
boolean isDistance, boolean nodeOverload) {
super(MiscelFunctions.sortByRevenues(stack),
new AvailableResourcesNodeMapping(stack.getSubstrate(),
distance, isDistance, nodeOverload),
new PathSplittingVirtualLinkMapping(stack.getSubstrate(),
weightCpu, weightBw));
}