Class Bernoulli1Result

java.lang.Object
jline.api.dqsys.Bernoulli1Result

public final class Bernoulli1Result extends Object
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

    Fields
    Modifier and Type
    Field
    Description
    final 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 int
    Buffer capacity in jobs, Integer.MAX_VALUE when unbounded.
    final double
    Probability of an empty system, pi(0).
    final double
    Fraction of offered arrivals lost, 0 on an unbounded buffer.
    final double
    Mean number of jobs in the system.
    final double
    Mean sojourn time in slots, by Little's law.
    final double
    Mean number of jobs waiting, i.e.
    final double
    Mean waiting time in slots.
    final double
    Normalizing 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 double
    Carried departures per slot.
    final double
    Fraction of slots with the server busy, 1 - pi(0).
  • Constructor Summary

    Constructors
    Constructor
    Description
    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)
     
  • Method Summary

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
  • Field Details

    • capacity

      public final int capacity
      Buffer capacity in jobs, Integer.MAX_VALUE when unbounded.
    • arrivalProb

      public final double[] arrivalProb
      Offered per-slot arrival probability b(n), indexed by n = 0..L.
    • serviceProb

      public final double[] serviceProb
      Per-slot service completion probability p(n), indexed by n-1.
    • pmf

      public final double[] pmf
      Time-stationary queue length law of theorem 2.3, pmf[n].
    • arrivalPmf

      public final double[] arrivalPmf
      Arrival queue length law of theorem 2.11, arrivalPmf[n].
    • emptyProb

      public final double emptyProb
      Probability of an empty system, pi(0).
    • utilization

      public final double utilization
      Fraction of slots with the server busy, 1 - pi(0).
    • throughput

      public final double throughput
      Carried departures per slot.
    • lossProb

      public final double lossProb
      Fraction of offered arrivals lost, 0 on an unbounded buffer.
    • meanQueueLength

      public final double meanQueueLength
      Mean number of jobs in the system.
    • meanWaitingQueue

      public final double meanWaitingQueue
      Mean number of jobs waiting, i.e. not in service.
    • meanSojournTime

      public final double meanSojournTime
      Mean sojourn time in slots, by Little's law.
    • meanWaitingTime

      public final double meanWaitingTime
      Mean waiting time in slots.
    • normConst

      public final double normConst
      Normalizing 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)