LINE Solver (C++)
Templated C++ port of the LINE queueing solver
Loading...
Searching...
No Matches
fes_map_interdeparture.h File Reference

Inter-departure MAP of a closed subnetwork made of one MAP station and one MAP flow-equivalent server. More...

#include <cstddef>
#include <vector>
#include "line/api/fes/fes_map_levels.h"
#include "line/api/mam/map_moment.h"
#include "line/num/number.h"
#include "line/util/error.h"
#include "line/util/matrix.h"
Include dependency graph for fes_map_interdeparture.h:

Go to the source code of this file.

Namespaces

namespace  line
namespace  line::fes

Functions

template<class T>
mam::Map< T > line::fes::fes_map_interdeparture (const std::vector< mam::Map< T > > &maps, const std::vector< mam::Map< T > > &fes, std::size_t n)
 Inter-departure MAP of a closed subnetwork made of one MAP station and one MAP flow-equivalent server.

Detailed Description

Inter-departure MAP of a closed subnetwork made of one MAP station and one MAP flow-equivalent server.

Templated port of matlab/src/api/fes/fes_map_interdeparture.m, mirrored by the JAR and native Python. Implements the block bidiagonal construction of Casale, Mi, Cherkasova and Smirni, IEEE Trans. Soft. Eng. 37(5), 2011, Section 5.2.2:

T0 = [ D0 (x) I 0 0 0 I (x) F1^1 D0 (+) F0^1 0 0 ... ... ... ... 0 I (x) F1^{n-1} D0 (+) F0^{n-1} 0 0 0 I (x) F1^n I (x) F0^n ]

T1 = superdiagonal blocks D1 (x) I, last block row zero

Level k is the population of the flow-equivalent server, so the station holds n - k jobs and both processes may be load dependent. Marked transitions are the completions of the station, which are the departures fed to the rest of the model.

ARITHMETIC: field operations only, exact at T = Rational.

Definition in file fes_map_interdeparture.h.