Package jline.api.nc
Class MeGegecnResult
java.lang.Object
jline.api.nc.MeGegecnResult
Solution of a censored GE/GE/c/K;N queue by entropy maximisation.
-
Constructor Summary
ConstructorsConstructorDescriptionMeGegecnResult(double[] p, int K, int N, double L, double U, double PB, double Lq) -
Method Summary
Modifier and TypeMethodDescriptionbooleanintgetK()Minimum number of jobs in the queue.doublegetL()Mean number of jobs in the queue.doublegetLq()Mean number of jobs waiting.intgetN()Buffer capacity in jobs.double[]getP()Queue length distribution, p[idx] = Pr{n = K+idx}.doublegetPB()Probability that an arrival of the queue's own stream finds it full.doublegetU()Utilization, E[min(n,c)]/c.inthashCode()
-
Constructor Details
-
MeGegecnResult
public MeGegecnResult(double[] p, int K, int N, double L, double U, double PB, double Lq)
-
-
Method Details
-
getP
public double[] getP()Queue length distribution, p[idx] = Pr{n = K+idx}. -
getK
public int getK()Minimum number of jobs in the queue. -
getN
public int getN()Buffer capacity in jobs. -
getL
public double getL()Mean number of jobs in the queue. -
getU
public double getU()Utilization, E[min(n,c)]/c. -
getPB
public double getPB()Probability that an arrival of the queue's own stream finds it full. -
getLq
public double getLq()Mean number of jobs waiting. -
equals
-
hashCode
public int hashCode()
-