|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectbcds.phison.ra.RoutingAlgBase<V,E>
bcds.phison.ra.LMIR<V,E>
public class LMIR<V,E>
Implements the LMIR routing algorithm as described in:
NOTES
Constructor Summary | |
---|---|
LMIR()
Default constructor. |
|
LMIR(TED<V,E> ted,
Environ env)
Creates a new instance and passes the parameters to setup. |
Method Summary | |
---|---|
void |
dumpState()
Prints to stdout internal variables. |
Path<V,E> |
run(V src,
V dest,
int rq_cap)
Returns al LMIR path from src to dest whose links
have residual capacity at least equal to rq_cap , or null
if no path can be found. |
void |
setup(TED<V,E> ted,
Environ env)
Resets all internal data structures. |
Methods inherited from class bcds.phison.ra.RoutingAlgBase |
---|
buildPathFromParentNodes, commitBackupPath, commitWorkingPath, getBackupPath, getCost, getEnviron, getEnvParams, getName, getTED, getWorkingPath, offersProtection, setBackupPath, setRequest, setWorkingPath, topologyHasChanged, uncommitBackupPath, uncommitWorkingPath |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Methods inherited from interface bcds.phison.ra.RoutingAlg |
---|
commitBackupPath, commitWorkingPath, getBackupPath, getCost, getName, getWorkingPath, offersProtection, topologyHasChanged, uncommitBackupPath, uncommitWorkingPath |
Methods inherited from interface bcds.phison.WithEnvParams |
---|
getEnviron, getEnvParams |
Constructor Detail |
---|
public LMIR()
setup(TED, Environ)
must be called.
public LMIR(TED<V,E> ted, Environ env)
env
may be null but the first one must not. No environment parameter
is expected or used by this class.
Method Detail |
---|
public void setup(TED<V,E> ted, Environ env)
setup
in interface RoutingAlg<V,E>
setup
in class RoutingAlgBase<V,E>
public Path<V,E> run(V src, V dest, int rq_cap)
src
to dest
whose links
have residual capacity at least equal to rq_cap
, or null
if no path can be found.
Each invocation of this method implies a full recomputation of the
weights. Despite it is a "light" MIRA, LMIR is still much slower
than other algorithms, for example Dijkstra.
run
in interface RoutingAlg<V,E>
public void dumpState()
dumpState
in interface RoutingAlg<V,E>
dumpState
in class RoutingAlgBase<V,E>
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |