Package jline.api.dqsys
Class Bernoulli1Result
java.lang.Object
jline.api.dqsys.Bernoulli1Result
Steady-state quantities of a state dependent Bernoulli server.
Every time is a number of slots and every rate a per-slot probability.
-
Field Summary
FieldsModifier and TypeFieldDescriptionfinal double[]Arrival queue length law of theorem 2.11,arrivalPmf[n].final double[]Offered per-slot arrival probability b(n), indexed by n = 0..L.final intBuffer capacity in jobs,Integer.MAX_VALUEwhen unbounded.final doubleProbability of an empty system, pi(0).final doubleFraction of offered arrivals lost, 0 on an unbounded buffer.final doubleMean number of jobs in the system.final doubleMean sojourn time in slots, by Little's law.final doubleMean number of jobs waiting, i.e.final doubleMean waiting time in slots.final doubleNormalizing constant H of theorem 2.3.final double[]Time-stationary queue length law of theorem 2.3,pmf[n].final double[]Per-slot service completion probability p(n), indexed by n-1.final doubleCarried departures per slot.final doubleFraction of slots with the server busy, 1 - pi(0). -
Constructor Summary
ConstructorsConstructorDescriptionBernoulli1Result(int capacity, double[] arrivalProb, double[] serviceProb, double[] pmf, double[] arrivalPmf, double emptyProb, double utilization, double throughput, double lossProb, double meanQueueLength, double meanWaitingQueue, double meanSojournTime, double meanWaitingTime, double normConst) -
Method Summary
-
Field Details
-
capacity
public final int capacityBuffer capacity in jobs,Integer.MAX_VALUEwhen unbounded. -
arrivalProb
public final double[] arrivalProbOffered per-slot arrival probability b(n), indexed by n = 0..L. -
serviceProb
public final double[] serviceProbPer-slot service completion probability p(n), indexed by n-1. -
pmf
public final double[] pmfTime-stationary queue length law of theorem 2.3,pmf[n]. -
arrivalPmf
public final double[] arrivalPmfArrival queue length law of theorem 2.11,arrivalPmf[n]. -
emptyProb
public final double emptyProbProbability of an empty system, pi(0). -
utilization
public final double utilizationFraction of slots with the server busy, 1 - pi(0). -
throughput
public final double throughputCarried departures per slot. -
lossProb
public final double lossProbFraction of offered arrivals lost, 0 on an unbounded buffer. -
meanQueueLength
public final double meanQueueLengthMean number of jobs in the system. -
meanWaitingQueue
public final double meanWaitingQueueMean number of jobs waiting, i.e. not in service. -
meanSojournTime
public final double meanSojournTimeMean sojourn time in slots, by Little's law. -
meanWaitingTime
public final double meanWaitingTimeMean waiting time in slots. -
normConst
public final double normConstNormalizing constant H of theorem 2.3.
-
-
Constructor Details
-
Bernoulli1Result
public Bernoulli1Result(int capacity, double[] arrivalProb, double[] serviceProb, double[] pmf, double[] arrivalPmf, double emptyProb, double utilization, double throughput, double lossProb, double meanQueueLength, double meanWaitingQueue, double meanSojournTime, double meanWaitingTime, double normConst)
-