Package jline.api.nc

Class Me_oqn

java.lang.Object

jline.api.nc.Me_oqn

public final class Me_oqn
extends Object

Method Summary

Modifier and Type	Method	Description
static MeOqnResult	me_oqn(int M, int R, Matrix lambda0, Matrix Ca0, Matrix mu, Matrix Cs, Matrix[][] P)
static MeOqnResult	me_oqn(int M, int R, Matrix lambda0, Matrix Ca0, Matrix mu, Matrix Cs, Matrix[][] P, MeOqnOptions options)
static MeOqnResult	me_oqn(int M, int R, Matrix lambda0, Matrix Ca0, Matrix mu, Matrix Cs, Matrix[][] P, Matrix c, boolean[] insens, MeOqnOptions options)	Maximum Entropy algorithm for Open Queueing Networks with discipline-aware building blocks: insens[i] marks a station with an insensitive scheduling discipline (PS, LCFS-PR), solved with the product-form mean queue length L_r = rho_r/(1-rho) instead of the FCFS GE formula.
static MeOqnResult	me_oqn(int M, int R, Matrix lambda0, Matrix Ca0, Matrix mu, Matrix Cs, Matrix[][] P, Matrix c, MeOqnOptions options)	Maximum Entropy algorithm for Open Queueing Networks.

Methods inherited from class java.lang.Object

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

Method Details

me_oqn

public static MeOqnResult me_oqn(int M,
 int R,
 Matrix lambda0,
 Matrix Ca0,
 Matrix mu,
 Matrix Cs,
 Matrix[][] P)

me_oqn

public static MeOqnResult me_oqn(int M,
 int R,
 Matrix lambda0,
 Matrix Ca0,
 Matrix mu,
 Matrix Cs,
 Matrix[][] P,
 MeOqnOptions options)

me_oqn

public static MeOqnResult me_oqn(int M,
 int R,
 Matrix lambda0,
 Matrix Ca0,
 Matrix mu,
 Matrix Cs,
 Matrix[][] P,
 Matrix c,
 MeOqnOptions options)

Maximum Entropy algorithm for Open Queueing Networks.

Parameters:

M - number of queues (stations)

R - number of job classes

lambda0 - external arrival rates [M x R]

Ca0 - external arrival scvs [M x R]

mu - service rates [M x R]

Cs - service scvs [M x R]

P - routing probabilities, P[j][i].get(r,0) = p_ji,r

c - servers per queue [M x 1]; Double.POSITIVE_INFINITY marks an infinite-server (IS) queue

options - algorithm options (tolerance, max iterations, verbosity)

Returns:

mean queue lengths, response times, arrival/departure scvs, arrival rates (inclusive of self-loop revisits), utilizations and the iteration count

me_oqn

public static MeOqnResult me_oqn(int M,
 int R,
 Matrix lambda0,
 Matrix Ca0,
 Matrix mu,
 Matrix Cs,
 Matrix[][] P,
 Matrix c,
 boolean[] insens,
 MeOqnOptions options)

Maximum Entropy algorithm for Open Queueing Networks with discipline-aware building blocks: insens[i] marks a station with an insensitive scheduling discipline (PS, LCFS-PR), solved with the product-form mean queue length L_r = rho_r/(1-rho) instead of the FCFS GE formula.