fes_map_aggregate.h File Reference

Recursive MAP flow-equivalent server for a station subset. More...

#include <cstddef>
#include <string>
#include <vector>
#include "line/api/fes/fes_map_interdeparture.h"
#include "line/api/fes/fes_map_interp.h"
#include "line/api/fes/fes_map_levels.h"
#include "line/api/fes/fes_map_moments.h"
#include "line/api/mam/map2_fit_idc.h"
#include "line/api/mam/map_moment.h"
#include "line/num/number.h"
#include "line/util/error.h"

Include dependency graph for fes_map_aggregate.h:

Go to the source code of this file.

Classes
struct	line::fes::FesMapAggregateResult< T >
	The load-dependent MAP that replaces a subnetwork, with its descriptors. More...

Namespaces
namespace	line
namespace	line::fes

Functions
template<class T>
FesMapAggregateResult< T >	line::fes::fes_map_aggregate (const std::vector< mam::Map< T > > &maps, const std::vector< double > &servers, std::size_t n, const std::vector< std::size_t > &grid, const std::string &method="ssolve")
	Recursive MAP flow-equivalent server for a station subset.
template<class T>
FesMapAggregateResult< T >	line::fes::fes_map_aggregate (const std::vector< mam::Map< T > > &maps, const std::vector< double > &servers, std::size_t n)
	Aggregation on the default population grid.

Detailed Description

Recursive MAP flow-equivalent server for a station subset.

Templated port of matlab/src/api/fes/fes_map_aggregate.m, mirrored by the JAR and native Python. 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. The result is one MAP per level, the service process of a single load-dependent station replacing the whole subnetwork. Unlike the classic flow-equivalent server, which keeps only the mean throughput of the subnetwork, this one also carries the burstiness of its 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, as MAPs fitted at neighbouring populations are similar. The MAP is refitted at every level from the interpolated descriptors, never interpolated entrywise.

ARITHMETIC: transcendental, inherited from map2_fit_idc.

Definition in file fes_map_aggregate.h.