Package jline.api.pfqn.mva

Class Pfqn_debemva

java.lang.Object

jline.api.pfqn.mva.Pfqn_debemva

public final class Pfqn_debemva
extends Object

debeMVA (Algorithms 1 and 2) of V. de Nitto Persone and A. Di Lonardo, "Approximating finite resources: An approach based on MVA", Performance Evaluation 131:1-21, 2019. Port of MATLAB pfqn_debemva.m.

Closed single-class network of M stations. A queue is a single exponential server with total capacity K(i); a delay is an infinite server of any distribution, never full. Blocking is Blocking-After-Service with first-blocked-first-unblocked release.

MVA on k = 1..N with residence time S(i)*(z(i)+n(i,k-1))+BT(i) at a queue and S(i)+BT(i)/k at a delay. The arrival job function z (start 1) and the blocking time BT (start 0) persist across populations. Algorithm 2 first adjusts them around the slowest finite stations once k > K(j)+1; each pass then moves the share 1-K(j)/k of z(j) upstream for every station with n(j) > K(j)+tol, charges the blocking time P(i,j)*S(j)^2/(S(i)+S(j)), and restores any queue that fell below its value at k-1 by taking the difference from its upstream stations. tol = 0 is the paper's strict test. A capacity K(i) >= N is treated as unbounded.

Results follow the paper, so a blocked job is counted at the SOURCE, whereas LINE's CTMC/JMT/LDES count it at the full destination.

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static final class	Pfqn_debemva.Result	Result of pfqn_debemva(int, jline.util.matrix.Matrix, jline.util.matrix.Matrix, jline.util.matrix.Matrix, boolean[], double, int); every vector is M x 1.

Method Summary

Modifier and Type	Method	Description
static Pfqn_debemva.Result	pfqn_debemva(int N, Matrix S, Matrix P, Matrix K, boolean[] isdelay, double tol, int iter_max)	Runs debeMVA.

Methods inherited from class java.lang.Object

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

Method Details

pfqn_debemva

public static Pfqn_debemva.Result pfqn_debemva(int N,
 Matrix S,
 Matrix P,
 Matrix K,
 boolean[] isdelay,
 double tol,
 int iter_max)

Runs debeMVA.

Parameters:

N - population (positive integer)

S - mean service time per visit at each station (M x 1)

P - station routing matrix (M x M, row-stochastic, irreducible)

K - station capacity (M x 1, Infinity for unbounded; ignored at delays)

isdelay - true at infinite-server stations (length M), or null for none

tol - slack on the capacity test n(j) > K(j)+tol (the paper: 0)

iter_max - maximum passes at one population

Returns:

the per-station measures and the convergence status