mascoptDev.algos.networks
Class ApproxMinCostFlowStraight

java.lang.Object
  |
  +--mascoptDev.algos.networks.ApproxMinCostFlow
        |
        +--mascoptDev.algos.networks.ApproxMinCostFlowStraight

public class ApproxMinCostFlowStraight

extends ApproxMinCostFlow

Provides an algorithm of approximation of fractionnal MCF by "Lagrangienne" relaxation. TIME IS OUT OF BOUND on examples of file/nfsnet.mgl and file/americain-mieux.mgl Initialize the flow with the shortest paths (Bellman) in terms of the congestion cost for all requests, no constraint of capacity. while the capacity constraints isn't satisfaied, divert the flow between the most loaded paths and the least loaded paths. Use the congestion cost(Arc) in 4 straights, to use other cost see ApproxMinCostFlowStages, ApproxMinCostFlow.

Field Summary

Fields inherited from class mascoptDev.algos.networks.ApproxMinCostFlow

CAPACITY_STRING_VALUE, congestion, CONGESTION_MAX, costCongestion, EPSILON, EPSILON_END, flowAllocated, INDEX, nbArc, nbRequest, REQUEST_SIZE, W

Constructor Summary

ApproxMinCostFlowStraight(WDMNetwork n)

Method Summary

void	costCongestion(Arc a) Calculate the cost of the congestion, with the 3 fonctions according to the value of the congestion of cable a.

Methods inherited from class mascoptDev.algos.networks.ApproxMinCostFlow

addFlow, deCongest, deCongestFlow, getCongestion, getFlow, getFlowAllocated, printFlow, setCongestion, setFlow, setFlowAllocated, writeSolution

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

ApproxMinCostFlowStraight

public ApproxMinCostFlowStraight(WDMNetwork n)

Method Detail

costCongestion

public void costCongestion(Arc a)

Calculate the cost of the congestion, with the 3 fonctions according to the value of the congestion of cable a.

Parameters:

a - the Arc representing a cable of the problem.