Package jline.io

Class Ret.pfqnHarelBounds

java.lang.Object
jline.io.Ret.pfqnHarelBounds
Enclosing class:
Ret
public static class Ret.pfqnHarelBounds extends Object
Result type for Harel et al. throughput bounds for closed queueing networks.

This class encapsulates the output of the pfqn_harel_bounds function which implements the throughput bounds from Harel, Namn, and Sturm (1999) "Simple bounds for closed queueing networks", Queueing Systems 31:125-135.

The bounds provide:

  • LB: Lower bound on throughput (tighter than Zahorjan's balanced job bound)
  • UB(n): Upper bounds on throughput for various n values

  • Field Summary

    Fields
    Modifier and Type
    Field
    Description
    int
    k
    Number of queues k
    double
    LB
    Lower bound on throughput
    int
    maxN
    Maximum n for which UB(n) was computed
    int
    N
    Population size N
    double[]
    TH
    Exact throughput values TH(n) for n=1,2,...,maxN (used to compute UB)
    double[]
    UB
    Upper bounds UB(n) for n=2,3,...,maxN

  • Constructor Summary

    Constructors
    Constructor
    Description
    pfqnHarelBounds(double LB, double[] UB, double[] TH, int N, int k, int maxN)
     

  • Method Summary

    Methods inherited from class java.lang.Object

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

  • Field Details

    • LB

      public double LB
      Lower bound on throughput

    • UB

      public double[] UB
      Upper bounds UB(n) for n=2,3,...,maxN

    • TH

      public double[] TH
      Exact throughput values TH(n) for n=1,2,...,maxN (used to compute UB)

    • N

      public int N
      Population size N

    • k

      public int k
      Number of queues k

    • maxN

      public int maxN
      Maximum n for which UB(n) was computed

  • Constructor Details

    • pfqnHarelBounds

      public pfqnHarelBounds(double LB, double[] UB, double[] TH, int N, int k, int maxN)