pfqn_chow.h File Reference

JMT-compatible Chow approximate MVA. More...

#include <cstddef>
#include <vector>
#include "line/api/pfqn/pfqn_lcp.h"

Include dependency graph for pfqn_chow.h:

Go to the source code of this file.

Namespaces
namespace	line
	Conservation laws of a layered queueing network, enumerated from its structure.
namespace	line::pfqn

Enumerations
enum class	line::pfqn::ChowVariant { line::pfqn::Forward , line::pfqn::Backward }
	Legacy compatibility selector; JMT-compatible Chow ignores it. More...

Functions
template<class T>
AmvaResult< T >	line::pfqn::pfqn_chow (const Matrix< T > &L, const std::vector< T > &N, const std::vector< T > &Z, const std::vector< AmvaSched > &type, double tol=1e-6, std::size_t maxiter=1000, const Matrix< T > &QN0=Matrix< T >(), ChowVariant variant=ChowVariant::Forward)
	JMT-compatible Chow approximate MVA.
template<class T>
AmvaResult< T >	line::pfqn::pfqn_chow (const Matrix< T > &L, const std::vector< T > &N, const std::vector< T > &Z)
template<class T>
AmvaResult< T >	line::pfqn::pfqn_chow (const Matrix< T > &L, const std::vector< T > &N)

Detailed Description

JMT-compatible Chow approximate MVA.

JMT estimates every class's arrival-instant queue length at a station by the aggregate queue length at the full population. This is the Bard large-customer-population fixed point implemented by pfqn_lcp.

Definition in file pfqn_chow.h.