Package jline.api.pfqn.mva

Class Pfqn_oqnrc

java.lang.Object

jline.api.pfqn.mva.Pfqn_oqnrc

public final class Pfqn_oqnrc
extends Object

Approximate MVA of R. Buitenhek, G.-J. van Houtum, H. Zijm, "Approximate MVA algorithms for open queueing networks with restricted capacity" (University of Twente, 1997). Port of MATLAB pfqn_oqnrc.m.

An open network whose inner system holds at most Ncap[g] jobs of the classes in token pool g. Blocked arrivals wait outside (WAITQ, the paper) or are lost (DROP). Each pool is a closed token chain with a load-dependent synchronization station, nu(1) = lam_g/q_g, q_g = 1 - lam_g/TH_g^C(N_g) (q_g = 1 under DROP), solved by the approximate MVA recursion of the paper's Appendix over the population lattice. FCFS multi-server stations use the residual-service approximation, PS and INF are exact.

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static final class	Pfqn_oqnrc.Result	Result of pfqn_oqnrc(double[], jline.util.matrix.Matrix, jline.util.matrix.Matrix, jline.util.matrix.Matrix, double[], boolean[], int[], int[], boolean, double, int).

Method Summary

Modifier and Type	Method	Description
static Pfqn_oqnrc.Result	pfqn_oqnrc(double[] lam, Matrix A, Matrix S, Matrix SCV, double[] nservers, boolean[] isps, int[] pool, int[] Ncap, boolean waitq, double tol, int iterMax)	Runs OQNRC.

Methods inherited from class java.lang.Object

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

Method Details

pfqn_oqnrc

public static Pfqn_oqnrc.Result pfqn_oqnrc(double[] lam,
 Matrix A,
 Matrix S,
 Matrix SCV,
 double[] nservers,
 boolean[] isps,
 int[] pool,
 int[] Ncap,
 boolean waitq,
 double tol,
 int iterMax)

Runs OQNRC.

Parameters:

lam - external arrival rate of each class (length R)

A - arrival rate of class r at station m (M x R)

S - mean service time (M x R)

SCV - squared coefficient of variation of the service time (M x R)

nservers - servers per station, Infinity at a delay (length M)

isps - true at processor-sharing stations (length M)

pool - token pool of each class, 0-based (length R)

Ncap - tokens of each pool (length G)

waitq - true when blocked arrivals wait, false when they are lost

tol - multi-pool fixed point tolerance

iterMax - multi-pool fixed point iteration cap

Returns:

the result