Package jline.api.pfqn.mva

Class Pfqn_lcp

java.lang.Object

jline.api.pfqn.mva.Pfqn_lcp

public final class Pfqn_lcp
extends Object

Bard Large Customer Population (LCP) approximate MVA.

Y. Bard, "Some extensions to multiclass queueing network analysis", in Performance of Computer Systems, North-Holland, 1979. The first approximate MVA algorithm: it estimates the arrival-instant queue length by the time-averaged one WITHOUT removing the arriving customer,

A_k^(c)(N) = Q_k(N - 1_c) ~= Q_k(N) = sum_s Q_ks(N),

since with a large population one customer less cannot change the mean queue lengths appreciably. Setting the Bard-Schweitzer proportional term Q_kc(N)/N_c to zero recovers this algorithm, so LCP is uniformly more pessimistic than Pfqn_bs and is inaccurate at small populations.

Method Summary

Modifier and Type	Method	Description
static Ret.pfqnAMVA	pfqn_lcp(Matrix L, Matrix N)
static Ret.pfqnAMVA	pfqn_lcp(Matrix L, Matrix N, Matrix Z)
static Ret.pfqnAMVA	pfqn_lcp(Matrix L, Matrix N, Matrix Z, double tol, int maxiter, Matrix QN0)
static Ret.pfqnAMVA	pfqn_lcp(Matrix L, Matrix N, Matrix Z, double tol, int maxiter, Matrix QN0, SchedStrategy[] type)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Details

pfqn_lcp

public static Ret.pfqnAMVA pfqn_lcp(Matrix L,
 Matrix N)

pfqn_lcp

public static Ret.pfqnAMVA pfqn_lcp(Matrix L,
 Matrix N,
 Matrix Z)

pfqn_lcp

public static Ret.pfqnAMVA pfqn_lcp(Matrix L,
 Matrix N,
 Matrix Z,
 double tol,
 int maxiter,
 Matrix QN0)

pfqn_lcp

public static Ret.pfqnAMVA pfqn_lcp(Matrix L,
 Matrix N,
 Matrix Z,
 double tol,
 int maxiter,
 Matrix QN0,
 SchedStrategy[] type)