Class Pfqn_mva

java.lang.Object
jline.api.pfqn.mva.Pfqn_mva

public final class Pfqn_mva extends Object
  • Method Details

    • pfqn_mva

      public static Ret.pfqnMVA pfqn_mva(Matrix L, Matrix N, Matrix Z, Matrix mi)
      Mean Value Analysis (MVA) Algorithm for closed Product-Form Queueing Networks. Exact solution is computed for several performance measures. Standard arrival theorem; for the interlocked-flow correction of Franks (1999), Ch. 4, Eq. (4.7) call Pfqn_mva_ilock instead.
      Parameters:
      mi - additive term of the residence-time recursion C(i,s)=L(i,s)*(mi(i)+Qarv), 1 for a queueing station; null for all ones. THIS IS NOT A SERVER COUNT: mi(i)=c inflates the residence time by c rather than adding c servers. For multiserver stations call Pfqn_mvams, which passes S to the load-dependent recursion with mu(i,n)=min(n,S(i)).
    • pfqn_mva

      public static Ret.pfqnMVA pfqn_mva(Matrix L, Matrix N, Matrix Z)
    • pfqn_mva

      public static Ret.pfqnMVA pfqn_mva(Matrix L, Matrix N)