Package jline.api.nc

Class Me_mqn

java.lang.Object

jline.api.nc.Me_mqn

public final class Me_mqn
extends Object

Method Summary

Modifier and Type	Method	Description
static MeCqnResult	me_mqn(int M, int R, boolean[] openClasses, Matrix lambda0, Matrix Ca0, Matrix N, Matrix mu, Matrix Cs, Matrix[][] P, Matrix c, int[] refstat, boolean[] insens, MeOqnOptions options)	Maximum Entropy algorithm for Mixed Queueing Networks with discipline-aware building blocks (insens[i] true for PS/LCFS-PR).
static MeCqnResult	me_mqn(int M, int R, boolean[] openClasses, Matrix lambda0, Matrix Ca0, Matrix N, Matrix mu, Matrix Cs, Matrix[][] P, Matrix c, int[] refstat, MeOqnOptions options)	Maximum Entropy algorithm for Mixed Queueing Networks.

Methods inherited from class java.lang.Object

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

Method Details

me_mqn

public static MeCqnResult me_mqn(int M,
 int R,
 boolean[] openClasses,
 Matrix lambda0,
 Matrix Ca0,
 Matrix N,
 Matrix mu,
 Matrix Cs,
 Matrix[][] P,
 Matrix c,
 int[] refstat,
 MeOqnOptions options)

Maximum Entropy algorithm for Mixed Queueing Networks. Composes the open (Section 3.2) and closed (Section 3.3) ME algorithms: (1) the open classes are solved by the open GE-type fixed point on the station set, ignoring the closed classes; (2) the closed classes are solved by the two-stage pseudo-open plus convolution algorithm on servers whose capacity is reduced by the open-class utilization; (3) the open mean queue lengths are inflated by the closed occupancy at single-server stations. Steps 2-3 are exact in the BCMP product-form limit. Only single-server and infinite-server stations are supported.

Parameters:

M - number of queues (stations)

R - number of job classes

openClasses - openClasses[r] true when class r is open

lambda0 - external arrival rates [M x R], zero for closed

Ca0 - external arrival scvs [M x R]

N - class populations [1 x R], infinite for open

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]; infinity marks IS

refstat - reference station per class [R], 0-based

options - algorithm options

Returns:

closed-form composition result (X holds the arrival rates for open classes and the reference-station throughputs for closed classes)

me_mqn

public static MeCqnResult me_mqn(int M,
 int R,
 boolean[] openClasses,
 Matrix lambda0,
 Matrix Ca0,
 Matrix N,
 Matrix mu,
 Matrix Cs,
 Matrix[][] P,
 Matrix c,
 int[] refstat,
 boolean[] insens,
 MeOqnOptions options)

Maximum Entropy algorithm for Mixed Queueing Networks with discipline-aware building blocks (insens[i] true for PS/LCFS-PR).