pfqnHarelBounds

All Implemented Interfaces:
```
public class Ret.pfqnHarelBounds

                    
```
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

Nested Class Summary

Nested Classes
Modifier and Type	Class	Description

Field Summary

Fields
Modifier and Type	Field	Description
`public double`	`LB`
`public Array<double>`	`UB`
`public Array<double>`	`TH`
`public int`	`N`
`public int`	`k`
`public int`	`maxN`

Constructor Summary

Constructors
Constructor	Description
`Ret.pfqnHarelBounds(double LB, Array<double> UB, Array<double> TH, int N, int k, int maxN)`

Enum Constant Summary

Enum Constants
Enum Constant	Description

Method Summary

Modifier and Type	Method	Description

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Ret.pfqnHarelBounds

Ret.pfqnHarelBounds(double LB, Array<double> UB, Array<double> TH, int N, int k, int maxN)

Method Detail