line::dpfqn Namespace Reference

Classes
struct	DtNcResult
	Constants of the state independent cycle, in one common scale. More...
struct	DtNcLdResult
	Constants of the state dependent cycle, in one common scale. More...

Functions
template<class T>
DtNcResult< T >	dpfqn_nc (const std::vector< T > &p, std::size_t N)
	Propositions 3.18 and 3.19 for a cycle with state independent service probabilities.
template<class T>
DtNcLdResult< T >	dpfqn_ncld (const std::vector< std::vector< T > > &P, std::size_t N)
	Theorem 3.2 for a cycle whose service probabilities depend on the local queue length.

Function Documentation

dpfqn_nc()

template<class T>

DtNcResult< T > line::dpfqn::dpfqn_nc	(	const std::vector< T > &	p,
		std::size_t	N )

Propositions 3.18 and 3.19 for a cycle with state independent service probabilities.

Parameters

p	per-slot service completion probabilities p_j in (0,1)
N	number of customers cycling in the J nodes

Definition at line 113 of file dpfqn_nc.h.

References dpfqn_nc(), line::dpfqn::DtNcResult< T >::G, line::dpfqn::DtNcResult< T >::G1, line::InputError::InputError(), and line::dpfqn::DtNcResult< T >::lG.

Referenced by dpfqn_nc(), and line::nc::solver_nc_dt().

dpfqn_ncld()

template<class T>

DtNcLdResult< T > line::dpfqn::dpfqn_ncld	(	const std::vector< std::vector< T > > &	P,
		std::size_t	N )

Theorem 3.2 for a cycle whose service probabilities depend on the local queue length.

Parameters

P	service probabilities, P[j][n-1] = p_j(n) in (0,1]
N	number of customers cycling in the J nodes

Definition at line 205 of file dpfqn_nc.h.

References dpfqn_ncld(), line::dpfqn::DtNcLdResult< T >::G, line::dpfqn::DtNcLdResult< T >::Gc, line::InputError::InputError(), line::dpfqn::DtNcLdResult< T >::lG, line::dpfqn::DtNcLdResult< T >::W, and line::dpfqn::DtNcLdResult< T >::Wa.

Referenced by dpfqn_ncld(), and line::nc::solver_nc_dt().