The utilizations and queue lengths read off an optimal pair tensor. More...

#include <line/api/mapqn/mapqn_qrf_common.h>

Public Attributes
std::vector< T >	UN
std::vector< T >	QN
std::vector< T >	BN
	The ALPHA-WEIGHTED diagonal marginal mean: the mean number of jobs actually in service, E[min(n,c)] at a c-server station, E[n] at a delay and P(n >= 1) where alpha is 1.

Detailed Description

template<class T>
struct line::mapqn::QrfMetrics< T >

The utilizations and queue lengths read off an optimal pair tensor.

Definition at line 469 of file mapqn_qrf_common.h.

Member Data Documentation

◆ BN

template<class T>

std::vector<T> line::mapqn::QrfMetrics< T >::BN

The ALPHA-WEIGHTED diagonal marginal mean: the mean number of jobs actually in service, E[min(n,c)] at a c-server station, E[n] at a delay and P(n >= 1) where alpha is 1.

It is what the departure rate is proportional to, since alpha(i,n) scales the completion rate, so a station's throughput is BN/stime exactly at the relaxed point. Equal to UN on the alpha-free arms, which is why they need no separate readout.

Definition at line 479 of file mapqn_qrf_common.h.

Referenced by line::mapqn::qrf_extract_results(), and line::ba::solver_ba_qrf_analyzer().