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

Mean value analysis of a closed network of fork-join subnetworks. More...

#include <cstddef>
#include <vector>
#include "line/api/fj/fj_harmonic.h"
#include "line/api/fj/fj_types.h"
#include "line/num/number.h"
#include "line/util/error.h"
Include dependency graph for fj_amva.h:

Go to the source code of this file.

Classes

struct  line::fj::FJAmvaResult< T >
 [R, Q, X, U] of fj_amva. More...

Namespaces

namespace  line
namespace  line::fj

Functions

template<class T>
FJAmvaResult< T > line::fj::fj_amva (const std::vector< T > &D, const std::vector< unsigned > &P, unsigned M, const T &Z)
 Mean value analysis of a closed network of fork-join subnetworks.

Detailed Description

Mean value analysis of a closed network of fork-join subnetworks.

Templated port of matlab/src/api/fj/fj_amva.m.

R_n(m) = D_n [ H_{P_n} + Q_n(m-1) ] X(m) = m / (Z + sum_n R_n(m)) Q_n(m) = X(m) R_n(m)

started from Q_n(0) = 0. With every P_n equal to one this is the exact single-class mean value analysis, because H_1 = 1; above that it is an approximation whose per-subnetwork residence time is an upper bound in the sense of Varki.

Definition in file fj_amva.h.