Package jline.api.nc

Class Me_gegecn

java.lang.Object

jline.api.nc.Me_gegecn

public final class Me_gegecn
extends Object

Method Summary

Modifier and Type	Method	Description
static MeGegecnResult	me_gegecn(double lambda, double Ca, double mu, double Cs, int c, int K, int N)	Solves a censored GE/GE/c/K;N queue by entropy maximisation.
static double	me_gegecn_pb(double[] p, int K, int N, int c, double Cs, double Ca)	Blocking probability seen by one arrival stream of a censored GE/GE/c/K;N queue, equation (4.3) of the source.

Methods inherited from class java.lang.Object

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

Method Details

me_gegecn

public static MeGegecnResult me_gegecn(double lambda,
 double Ca,
 double mu,
 double Cs,
 int c,
 int K,
 int N)

Solves a censored GE/GE/c/K;N queue by entropy maximisation.

Parameters:

lambda - arrival rate offered to the queue, the arrivals that are turned away included

Ca - squared coefficient of variation of the interarrival times (Ca >= 1, the GE distribution being undefined below 1)

mu - service rate of one server

Cs - squared coefficient of variation of the service times (Cs >= 1)

c - number of servers, finite and at least one

K - minimum number of jobs in the queue

N - buffer capacity in jobs, in service included (N > K)

Returns:

the queue length distribution and its first moments

me_gegecn_pb

public static double me_gegecn_pb(double[] p,
 int K,
 int N,
 int c,
 double Cs,
 double Ca)

Blocking probability seen by one arrival stream of a censored GE/GE/c/K;N queue, equation (4.3) of the source. Because a GE arrival process is a batch process, an arrival can be blocked while the queue holds fewer than N jobs: the factor (1-tau)^(N-n) is the probability that the batch overflows the residual room, and the extra factor of the first sum accounts for the servers still idle. With a Poisson stream (Ca = 1) every term but n = N vanishes and PB reduces to the PASTA value p(N). The stream scv is a per-stream quantity, so the same node solution yields a different blocking probability for the external arrivals, for the flow from each upstream station and for the flow released by each holding node, which is how PBe, PB^i_j and PB^h_j are obtained in the transfer-blocking algorithm of Tahilramani, Manjunath and Bose (1999).

Parameters:

p - ME queue length distribution, p[idx] = Pr{n = K+idx}

K - minimum number of jobs in the queue

N - buffer capacity in jobs

c - number of servers

Cs - squared coefficient of variation of the service times

Ca - squared coefficient of variation of the interarrival times of the stream whose blocking probability is requested

Returns:

probability that an arrival of this stream finds the queue full