Package jline.api.pfqn.mva

Class Pfqn_mvaoi

java.lang.Object

jline.api.pfqn.mva.Pfqn_mvaoi

public final class Pfqn_mvaoi
extends Object

Mean-value analysis of a closed product-form queueing network composed of an aggregated infinite-server (delay) node, any number of load-independent (LI) single-server product-form queues, and any number of order-independent (OI) / pass-and-swap stations with empty swap graph. This is the mean-value counterpart of Pfqn_oi_nc and the marginal-distribution form Pfqn_mvaoi_marg: it returns the same exact per-class throughput and queue-lengths but WITHOUT computing any normalizing constant or joint marginal, using only mean quantities. It is the composition-dependent generalization of the Conditional MVA (CMVA) of Casale, "A Note on Stable Flow-Equivalent Aggregation in Closed Networks" (QUESTA 2009), extended to MULTIPLE OI stations by carrying one rate-shift vector s_i per OI station i (row i of the shift matrix S). Throughout, r and s index job classes; i indexes OI stations; j indexes LI queues. State (S, Nn) is processed by increasing sum(Nn); each OI station keeps its own D^i, rho^i and Q^i recursions driven by the common throughput X^{(S)}(Nn), and the population conservation aggregates every station's contribution: Nn_r = X_r Z_r + sum_j Q^{(j)}_r + sum_i Q^{(i)}_r, with the LI queue term Q^{(j)}_r = X_r D_{j,r}(1 + sum_s Q^{(j)}_s(Nn - e_r)). Port of matlab/src/api/pfqn/pfqn_mvaoi.m.

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static final class	Pfqn_mvaoi.Result	Result: per-class throughput X, OI queue-lengths Qoi (K x R), LI queue-lengths Qli (J x R), delay queue-length Qdelay (R).

Method Summary

Modifier and Type	Method	Description
static Pfqn_mvaoi.Result	pfqn_mvaoi(double[] Z, int[] N, ToDoubleFunction<int[]> mu)	Single-OI, delay-only convenience overload.
static Pfqn_mvaoi.Result	pfqn_mvaoi(double[] Z, int[] N, List<ToDoubleFunction<int[]>> mu, double[][] Dli)

Methods inherited from class java.lang.Object

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

Method Details

pfqn_mvaoi

public static Pfqn_mvaoi.Result pfqn_mvaoi(double[] Z,
 int[] N,
 ToDoubleFunction<int[]> mu)

Single-OI, delay-only convenience overload.

pfqn_mvaoi

public static Pfqn_mvaoi.Result pfqn_mvaoi(double[] Z,
 int[] N,
 List<ToDoubleFunction<int[]>> mu,
 double[][] Dli)

Parameters:

Z - (R) think-time demand vector of the aggregated delay node.

N - (R) closed population vector, finite.

mu - list {mu_1,...,mu_K} of OI total-service-rate functions of the per-class occupancy (count) vector n (same convention as Pfqn_oi_nc).

Dli - (J x R) per-class demand matrix of the LI single-server queues; null or empty when J = 0.