| Package | Description |
|---|---|
| de.uni_kl.cs.discodnc.nc | |
| de.uni_kl.cs.discodnc.nc.arrivalbounds | |
| de.uni_kl.cs.discodnc.network |
| Modifier and Type | Method | Description |
|---|---|---|
java.util.Set<ArrivalCurve> |
ArrivalBound.computeArrivalBound(Link link,
Flow flow_of_interest) |
|
static java.util.Set<ArrivalCurve> |
ArrivalBoundDispatch.computeArrivalBounds(Network network,
AnalysisConfig configuration,
Link link,
java.util.Set<Flow> flows_to_bound,
Flow flow_of_interest) |
| Modifier and Type | Field | Description |
|---|---|---|
(package private) java.util.Map<Link,java.util.Map<Flow,ArrivalCurve>> |
PmooSinkTreeTbRlABCache.map__link__entries |
| Modifier and Type | Method | Description |
|---|---|---|
protected void |
PmooSinkTreeTbRlABCache.addEntry(Link link,
Flow flow,
ArrivalCurve arrival_bound) |
|
java.util.Set<ArrivalCurve> |
PbooArrivalBound_Concatenation.computeArrivalBound(Link link,
Flow flow_of_interest) |
|
java.util.Set<ArrivalCurve> |
PbooArrivalBound_Concatenation.computeArrivalBound(Link link,
java.util.Set<Flow> f_xfcaller,
Flow flow_of_interest) |
|
java.util.Set<ArrivalCurve> |
PbooArrivalBound_PerHop.computeArrivalBound(Link link,
Flow flow_of_interest) |
|
java.util.Set<ArrivalCurve> |
PbooArrivalBound_PerHop.computeArrivalBound(Link link,
java.util.Set<Flow> f_xfcaller,
Flow flow_of_interest) |
|
java.util.Set<ArrivalCurve> |
PmooArrivalBound_SinkTreeTbRl.computeArrivalBound(Link link,
java.util.Set<Flow> f_xfcaller,
Flow flow_of_interest) |
This code path computes the parameters relevant to construct the resulting
arrival bound directly, i.e., it does not compute and store the entire curves
resulting from intermediate computations in order to do so.
|
java.util.Set<ArrivalCurve> |
PmooArrivalBound.computeArrivalBound(Link link,
Flow flow_of_interest) |
|
java.util.Set<ArrivalCurve> |
PmooArrivalBound.computeArrivalBound(Link link,
java.util.Set<Flow> f_xfcaller,
Flow flow_of_interest) |
Computes the PMOO arrival bound for a set of
flows_to_bound. |
java.util.Set<ArrivalCurve> |
TandemMatchingArrivalBound.computeArrivalBound(Link link,
Flow flow_of_interest) |
|
java.util.Set<ArrivalCurve> |
TandemMatchingArrivalBound.computeArrivalBound(Link link,
java.util.Set<Flow> f_xfcaller,
Flow flow_of_interest) |
|
java.util.Set<ArrivalCurve> |
PmooArrivalBound_SinkTreeTbRl.computeArrivalBoundDeConvolution(Link link,
java.util.Set<Flow> f_xfcaller,
Flow flow_of_interest) |
This code path uses the DiscoDNC's convolution operation.
|
java.util.Set<ArrivalCurve> |
PmooArrivalBound_SinkTreeTbRl.computeArrivalBoundDeConvolutionTBRL(Link link,
java.util.Set<Flow> f_xfcaller,
Flow flow_of_interest) |
This code path uses the DiscoDNC's convolution operation, like
computeArrivalBoundDeConvolutionTBRL does, yet, it uses the optimized
convolution and deconvolution operation, respectively, to directly compute
the relevant parameters defining the resulting curves.
|
java.util.Set<ArrivalCurve> |
PmooArrivalBound_SinkTreeTbRl.computeArrivalBoundHomogeneous(Link link,
java.util.Set<Flow> f_xfcaller,
Flow flow_of_interest) |
In homogeneous networks we can simply multiply the common latency with the
length of a flow's path instead of iterating over its servers and sum up for
each one's value individually.
|
protected ArrivalCurve |
PmooSinkTreeTbRlABCache.getEntry(Link link,
Flow flow) |
| Modifier and Type | Field | Description |
|---|---|---|
private java.util.Set<Link> |
Network.links |
|
private java.util.Map<Link,java.util.Set<Flow>> |
Network.map__link__flows |
|
private java.util.Map<Server,java.util.Set<Link>> |
Network.map__server__in_links |
|
private java.util.Map<Server,java.util.Set<Link>> |
Network.map__server__out_links |
|
private java.util.LinkedList<Link> |
Path.path_links |
| Modifier and Type | Method | Description |
|---|---|---|
Link |
Network.addLink(Server source,
Server destination) |
|
Link |
Network.addLink(java.lang.String alias,
Server source,
Server destination) |
|
Link |
Network.findLink(Server src,
Server dest) |
|
Link |
Flow.getPrecedingLink(Server s) |
|
Link |
Path.getPrecedingLink(Server s) |
|
Link |
Flow.getSucceedingLink(Server s) |
|
Link |
Path.getSucceedingLink(Server s) |
| Modifier and Type | Method | Description |
|---|---|---|
java.util.Set<Link> |
Network.getIncidentLinks(Server s) |
Returns a new set consisting of references to the links.
|
java.util.Set<Link> |
Network.getInLinks(Server s) |
Returns a new set consisting of references to the servers.
|
java.util.Set<Link> |
Network.getLinks() |
|
java.util.LinkedList<Link> |
Path.getLinks() |
|
java.util.List<Link> |
Flow.getLinksOnPath() |
|
java.util.Set<Link> |
Network.getOutLinks(Server s) |
Returns a new set consisting of references to the servers.
|
java.util.Map<org.apache.commons.math3.util.Pair<Link,Path>,java.util.Set<Flow>> |
Network.groupFlowsPerInlinkSubPath(Path p,
java.util.Set<Flow> flows_to_group) |
| Modifier and Type | Method | Description |
|---|---|---|
Path |
Network.createPath(Link link) |
|
java.util.Set<Flow> |
Network.getFlows(Link l) |
|
void |
Network.removeLink(Link l) |
| Modifier and Type | Method | Description |
|---|---|---|
private Path |
Network.createPathFromLinks(java.util.List<Link> path_links) |
|
java.util.Set<Flow> |
Network.getFlows(java.util.Set<Link> links) |