![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
Asymptotic-bound-analysis lower bound on throughput. More...
#include <algorithm>#include <vector>#include "line/num/number.h"#include "line/util/error.h"#include "line/util/matrix.h"Go to the source code of this file.
Namespaces | |
| namespace | line |
| namespace | line::pfqn |
Functions | |
| template<class T> | |
| T | line::pfqn::pfqn_xzabalow (const std::vector< T > &L, const T &N, const T &Z) |
| X >= N / (Z + N sum(L)), the ABA population bound. | |
Asymptotic-bound-analysis lower bound on throughput.
Templated port of matlab/src/api/pfqn/pfqn_xzabalow.m. Single-class model: L is the per-station demand vector, N the population, Z the think time.
All operations stay in the field, so the bound is exact in rational arithmetic: a bound computed exactly is worth having, since a bound violated only by rounding is indistinguishable from a real violation.
Definition in file pfqn_xzabalow.h.