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

Geometric-square-root bound, upper bound on throughput. More...

#include <algorithm>
#include <vector>
#include "line/num/number.h"
#include "line/util/error.h"
#include "line/util/matrix.h"
#include "line/api/pfqn/pfqn_qzgbup.h"
Include dependency graph for pfqn_xzgsbup.h:

Go to the source code of this file.

Namespaces

namespace  line
namespace  line::pfqn

Functions

template<class T>
line::pfqn::pfqn_xzgsbup (const std::vector< T > &L, const T &N, const T &Z)
 X = 2N / (R + sqrt(R^2 - 4 Z Lmax N)), R from the geometric queue bound.

Detailed Description

Geometric-square-root bound, upper bound on throughput.

Templated port of matlab/src/api/pfqn/pfqn_xzgsbup.m. Single-class model: L is the per-station demand vector, N the population, Z the think time.

Needs a square root, so it is available in double and high-precision arithmetic only; the static_assert makes an exact instantiation a compile error rather than a silent approximation.

Definition in file pfqn_xzgsbup.h.