Package jline.api.fes
Class Fes_map_aggregate
java.lang.Object
jline.api.fes.Fes_map_aggregate
Aggregates a subnetwork into a load-dependent MAP flow-equivalent server that reproduces
mean, variability and burstiness of its output.
Implements the recursion of Section 5.2.1 of Casale, Mi, Cherkasova and Smirni, IEEE
Trans. Soft. Eng. 37(5), 2011. The first station seeds the flow-equivalent server; every
further station is folded against the running server by building the inter-departure MAP
of the resulting pair at each population level and fitting a MAP(2) to its first three
moments and index of dispersion. Unlike the classic flow-equivalent server, which keeps
only the mean throughput, this one also carries the burstiness of the departure stream,
so a bottleneck switch across the aggregated resources stays visible to the rest of the
model.
Levels are evaluated on a grid and the four descriptors are interpolated between grid
points. The MAP is refitted at every level from the interpolated descriptors, never
interpolated entrywise.
Copyright (c) 2012-2026, Imperial College London
All rights reserved.
-
Method Summary
Modifier and TypeMethodDescriptionstatic FesMapAggregateResultfes_map_aggregate(List<MatrixCell> maps, double[] servers, int n) Aggregates a subnetwork on the default population grid.static FesMapAggregateResultfes_map_aggregate(List<MatrixCell> maps, double[] servers, int n, int[] grid, String method) Aggregates a subnetwork.
-
Method Details
-
fes_map_aggregate
public static FesMapAggregateResult fes_map_aggregate(List<MatrixCell> maps, double[] servers, int n) Aggregates a subnetwork on the default population grid.- Parameters:
maps- service process of each station, already scaled by its visit ratioservers- number of servers of each station, infinite for a delayn- largest population the flow-equivalent server must serve- Returns:
- the load-dependent MAP and the descriptors it was fitted from
-
fes_map_aggregate
public static FesMapAggregateResult fes_map_aggregate(List<MatrixCell> maps, double[] servers, int n, int[] grid, String method) Aggregates a subnetwork.- Parameters:
maps- service process of each station, already scaled by its visit ratioservers- number of servers of each station, infinite for a delayn- largest population the flow-equivalent server must servegrid- populations at which the inter-departure MAP is evaluatedmethod- moment evaluation method, "ssolve" or "euler"- Returns:
- the load-dependent MAP and the descriptors it was fitted from
-