# Determining Bounds on Assumption Errors in Operational Analysis

Authors: Neal M. Bengtson
Journal: Journal of Optimization
 (2014)

---

## Abstract

The technique of operational analysis (OA) is used in the study of systems performance, mainly for estimating mean values of various measures of interest, such as, number of jobs at a device and response times. The basic principles of operational analysis allow errors in assumptions to be quantified over a time period. The assumptions which are used to derive the operational analysis relationships are studied. Using Karush-Kuhn-Tucker (KKT) conditions bounds on error measures of these OA relationships are found. Examples of these bounds are used for representative performance measures to show limits on the difference between true performance values and those estimated by operational analysis relationships. A technique for finding tolerance limits on the bounds is demonstrated with a simulation example.


---

## Body

## 1. Introduction

The analysis of the performance of a network of devices is important in many areas. Computer systems and industrial manufacturing systems are two examples. The types of networks considered in this paper are operationally connected, queue and server devices. That is, each device is connected in some way with every other device in the network and each device may have a queue assigned to it. Certain information about these types of networks may be obtained using a technique known as operational analysis (OA). Relationships used to estimate performance measures (PMs) of networks may be derived in operational analysis under a few restrictive assumptions. OA is a technique which was originally defined as an aid in computer system performance analysis [1–6]. It can be an aid in the understanding of system performance in general [7] and is a complementary approach to stochastic analysis used in many networks of servers performance analyzes and in computer programs [8–14]. Other used or suggested applications for the OA approach include telecommunications [15], E-commerce [16, 17], flexible manufacturing systems [18], and Petri nets [19–21]. The performance measures derived are such things as average number of units at a device, average response time, and throughput. The behavior of a single, arbitrary device in a network will be considered.Two basic principles define the OA approach [2].(1)
All assumptions that are made in analyzing the performance of a real system should be subject to direct verification.
(2)
All variables that appear in any equation which characterize the performance of a real system should be verifiable by direct measurement.The validity of PM equations developed using these principles can be shown for a particular set of data because they are based on assumptions which can be directly tested by the observation of data produced by the system of interest over a finite period of time.The most widely used assumption about the data is that ofjob flow balance, that is, the number of arrivals to a network (for global flow balance) or to a device (for local flow balance) must be equal to the number of departures from that network or device. Also assumed is one step behavior: only one unit may arrive or depart the network or device at a time. Arrivals and completions do not occur simultaneously. The OA approach assumes that devices must have homogeneous service. That is, the service time of a device in a network is independent of the queue length at any device. Homogeneous arrivals are the corresponding condition for the arrival times. Homogeneous routing holds when the routing frequencies of jobs leaving a device are independent of the queue lengths at other devices in the network. Device homogeneity exists when the rate of output from a device is determined only by its queue length. Other assumptions can be invoked as the need arises to derive OA relations [22]. The only requirement is that these assumptions meet the two basic principles of testability given above.OA assumptions allow for the development of relationships which enable us to determine PMs by collecting only a few types of data, namely, the number of arrivals and departures for each device state and the total time spent in each state [23]. These PMs will be accurate only if the OA assumptions are met and only for the finite time period observed. The accuracy of the assumptions can be measured. A device state is the number of items (customers, jobs, entities, etc.) both waiting and in service at a device.While OA research was originally proposed as an aid in computer performance analysis, it is more general in that developments can be applicable to any system that generates time series data. This would include computer simulation.The Abbreviations section gives definitions of variable used in this paper. Error measures of various OA assumptions have been defined and are summarized in Table1 for job flow balance, homogeneous service, and homogeneous arrival [24]. The limit over time of the expected value and variance of the job flow balance error is zero [25] so that over time this error is not significant for data runs of reasonable length. The expected value over time of other error measures, such as, for the assumptions of homogeneous service and arrival, may not, in general, tend to zero [25].Table 1
Operational analysis error measures.
Assumption
State dependent error
Overall error
Job-flow balance
e
F
(
n
)
=
(
n
+
1
)
(
p
A
(
n
)
-
p
C
(
n
)
)
,
n
∈
I
e
F
=
∑
n
=
0
N
-
1
e
F
(
n
)
Homogeneous service
e
S
(
n
)
=
1
p
C
(
n
-
1
)
(
T
(
n
)
T
-
T
(
0
)
)
-
1
,
n
∈
I
+
e
S
*
=
∑
n
=
1
N
n
p
c
(
n
-
1
)
e
S
(
n
)
Homogeneous arrival
e
A
(
n
)
=
p
A
(
n
)
(
T
-
T
(
N
)
T
(
n
)
)
-
1
,
n
∈
I
e
A
*
=
∑
n
=
1
N
-
1
e
A
(
n
)
n
T
(
n
)
T
-
T
(
N
)Different error measures, in the form of relative errors, have been defined by Brumfield [22]. By presenting a set of new assumptions, formulas for the calculation of response time and average queue length in terms of the average and coefficient of variation of service times are developed. Two examples of these new assumptions are homogeneity of queueing and service and homogeneity of residuals. For arrival j “forward residual is either the time remaining in the service period during which j arrives or zero if arrival j begins a service period … similarly backward residual is either the time since the beginning of the service period during which j arrives or zero if arrival j begins a service period” [22]. Relative error formulas for response time are determined with these new assumptions in addition to the old assumptions of homogeneous service and homogeneous arrivals. Unfortunately, the error terms are quite complex since there are more assumptions with which to deal.If we are using a relationship to determine a PM derived under OA assumptions, then the resulting value of the PM is in error if the founding assumptions do not hold. This can be checked from the data because of the way OA assumptions are defined. The degree of error in the PM calculated is a function of the assumption error measures. Correction terms have been developed using the assumption error measures [24]. When added to the PMs these correction terms produce exact results. It is these correction terms which are studied in this paper.As an example, assume we are interested in obtaining a value for the average number of jobs in a computer system that a new job sees upon arrival. If we make the homogeneous service assumption, then this average may be estimated by [4]
(1)
n
-
A
S
=
n
-
U
-
1
,
where n
-
A
S  is average number of jobs at a device seen by an arriver, assuming homogeneous service, n
-  is average number of jobs at the device, and U  is device utilization.We are interested in finding a correction term, such that(2)
n
-
A
=
n
-
A
S
+
C
n
-
A
.
The correction term is equal to
(3)
C
n
-
A
=
e
F
-
e
S
*
,
where
(4)
e
F
=
∑
n
=
0
N
-
1
(
n
+
1
)
(
p
A
(
n
)
-
p
C
(
n
)
)
,
e
S
*
=
∑
n
=
1
N
n
p
C
(
n
-
1
)
e
S
(
n
)
.
Check the Abbreviations section for all symbol definitions. e
F is the error measure for the job flow balance assumption and e
S
* is a weak form of the homogeneous service error measure because it may be equal to 0 even when some or all the individual e
S
(
n
) values are not.There are a couple of problems with using the error measures to derive correction terms. One problem is that the amount of data needed to calculate an exact value for an assumption error measure is the same as to find the performance measure of interest directly. The process of determining the error measure for each assumption used to derive a relation, the correction term, and the PM estimate to which the correction term is added is a way of getting something which may be observed more directly. Finding exact values for performance measures in this indirect way over a finite time period may be worthwhile only if a number of PMs are desired. In this case, a single assumption error measure is determined for each assumption and applied to all the PM correction terms of interest.Another problem with the error measure technique is that these measures apply only to the data observed. For another run of data, new error measure values need to be found. This limitation may be acceptable if PMs cannot be measured directly without changing the nature of the system, for example, in a complex computer system. We would like a way to extend assumption error measures over longer sets of data and, thereby, say something about the system that generated the data. As Sevcik and Klawe [26] stated shortly after OA was introduced “Because operational analysis is based on assumptions that can be tested but that are very unlikely to be satisfied exactly in any finite time period, it is very important to develop a means of dealing with ‘fuzzy homogeneity’ or situations in which the various independence assumptions are satisfied within some tolerance.” This paper addresses this need to define these assumption bounds.The next section will illustrate how OA relations may be used to reduce data collection while estimating performance measures. This will be followed by a discussion of the determination of bounds on the OA assumption measurement errors for homogeneous service and homogeneous arrival. Sample calculations of these bounds will be presented afterward. An illustration of the use of bounds in a simulation will then be given.


## 2. Simplifying Data Collection

Calculating performance measures with OA relationships that are derived under one or more of the system behavior assumptions is usually simpler than using more direct relationships. This is because by making the assumptions a model has been created which reduces, perhaps artificially, the complexity of the behavior of the system. The result is that less information is needed to make an estimate of the PM than would be needed for a direct measurement.There are situations where it is impractical, if not impossible, to collect sufficient data to determine exact values for PMs over a finite period of time. In some cases, only an estimate of a PM is needed and it is not worthwhile to go to the trouble of determining the precise PM values. Any PM value obtained for a behavior sequence is only an estimate of the underlying system PM. With this realization in mind, it may seem unwise to spend a great deal of effort to obtain an exact value for a sequence which is, in turn, only an estimate of some other value. A good approximation of the sequence estimate may be sufficient.If we want the average response time,R, of a behavior sequence, we could accumulate the response times of all the jobs that go through the system and get the exact R by dividing by the number of jobs. A simpler procedure would be to say that response time is
(5)
R
=
S
1
-
U
,
where S  is mean time between completions during busy periods and U is utilization.This equation will give the exactR value if we have a behavior sequence for a single server queue which is in flow balance and has homogeneous arrivals and services. If these conditions do not hold, the equation will not give R exactly, but an estimate of R, call it R
′. If we collect only the idle time, T
(
0
), and the number of completions, C, we can use the same equation to find R
′. If the behavior sequence lasts for time T, then
(6)
U
=
1
-
T
(
0
)
T
,
S
=
T
-
T
(
0
)
C
.Another example calculates the average number of jobs at a device. With the same assumptions as for estimating response time, the average number of jobs in the queue/server system is(7)
n
-
=
U
1
-
U
.
This value takes even less data to calculate than does R
′. The direct calculation of n
- requires accumulating data every time there is an arrival or completion or requires keeping track of the total amount of time spent at each of the states.Using these equations for predicting future values forR and n
- of a system presents certain problems. For example, over future time, will the assumptions of the system behave in the same way? Since we can determine and use error measures of the assumptions in order to correct assumption derived PM estimate, it is not necessary that assumptions hold in the future if they have not in the past. With the determination of correction terms all that is really necessary is for the correction terms to remain relatively constant, that is, for the system’s violations of assumptions to remain the same over future time periods.Without knowledge of the assumption error measures and through them the correction terms, the performance measure estimates may be quite bad for any particular behavior sequence [23]. As stated before, in a stable system the job flow balance assumption error measure will go to zero as time increases, but, as shown in [24], this is not necessarily true for other assumption error measures. For any behavior sequence it is important to make some assessment, if possible, of the behavior of the PM correction terms.


## 3. Performance Measure Bounds

One approach to use the simplified OA formulas for PMs is to determine bounds on the maximum PM error. That is, we are interested in defining bounds on the difference between true values of various PMs at a device for particular state sequences and those PMs estimated by using relationships derived under operational analysis assumptions. We will assume the network is in steady state.In the following, bounds are found for the assumptions of homogeneous services and homogeneous arrivals. In the case of the job-flow balance assumption, we know that the expected value of the error measure and its variance go to zero [25]:
(8)
lim
t
→
∞
E
[
e
F
]
=
0
,
lim
t
→
∞
V
[
e
F
]
=
0
.
Therefore, as the length of the sequence increases the e
F can be expected to become insignificant.We will need to assume that a maximum value of the error for services and arrivals for any state is known or can be set. Call these valuesδ
S and δ
A for the maximum service error and maximum arrival error, respectively.


### 3.1. Bounds on Homogeneous Service Assumption Error

Ifδ
S is the maximum error for the homogeneous service assumption, then
(9)
|
e
S
(
n
)
|
≤
δ
S
n
∈
I
+
.
A more useful bound would be on the weak overall homogeneous service error:
(10)
e
S
*
≤
δ
S
*
.
But, this limit may be harder to know beforehand. Equation (9) may be used to find an upper bound on e
S
* by using the definition
(11)
e
S
*
=
∑
n
=
1
N
n
p
C
(
n
-
1
)
e
S
(
n
)
.
Substituting (9) yields
(12)
e
S
*
=
∑
n
=
1
N
n
p
C
(
n
-
1
)
|
e
S
(
n
)
|
≤
δ
S
∑
n
=
1
N
n
p
C
(
n
-
1
)
.
The term
(13)
∑
m
=
1
N
n
p
C
(
n
-
1
)
=
n
-
C
is the average number at the device seen by a completer. Therefore,
(14)
e
S
*
≤
δ
S
n
-
C
.The bound given by (14) does not take into consideration the fact that the e
S
(
n
) values are not independent. In fact, they are related by the expression
(15)
∑
n
=
1
N
p
C
(
n
-
1
)
e
S
(
n
)
=
0
.
We can get a tighter bound of the e
S
* values by taking this dependence into consideration. Equation (15) can be shown by substituting the definition
(16)
e
S
(
n
)
=
S
(
n
)
S
=
1
p
C
(
n
-
1
)
[
T
(
n
)
T
-
T
(
0
)
]
-
1
as follows:
(17)
∑
n
=
1
N
p
C
(
n
-
1
)
e
S
(
n
)
=
∑
n
=
1
N
p
C
(
n
-
1
)
[
1
p
C
(
n
-
1
)
T
(
n
)
T
-
T
(
0
)
-
1
]
=
∑
n
=
1
N
T
(
n
)
T
-
T
(
0
)
-
∑
n
=
1
N
p
C
(
n
-
1
)
=
T
-
T
(
0
)
T
-
T
(
0
)
-
1
=
0
.Since what is desired is an upper bound one
S
* a solution to the optimization problem below will give the desired result:
(18)
Max
e
S
*
=
∑
m
=
1
N
n
p
C
(
n
-
1
)
e
S
(
n
)
s
.
t
.
∑
n
=
1
N
p
C
(
n
-
1
)
e
S
(
n
)
=
0
|
e
S
(
n
)
|
≤
δ
S
n
∈
I
+
.
In order to show the optimal solution, first put this problem in primal and dual forms:primal:(19)
Max
∑
n
=
1
N
n
p
C
(
n
-
1
)
e
S
(
n
)
s
.
t
.
∑
n
=
1
N
p
C
(
n
-
1
)
e
S
(
n
)
=
0
h
:
u
-
e
S
(
n
)
≤
δ
S
n
∈
I
+
:
y
(
n
)
e
S
(
n
)
≤
δ
S
n
∈
I
+
hh
:
w
(
n
)
;
dual:(20)
Min
.
δ
∑
n
=
1
N
(
y
(
n
)
+
w
(
n
)
)
s
.
t
.
p
C
(
n
-
1
)
u
-
y
(
n
)
+
w
(
n
)
=
n
p
C
(
n
-
1
)
n
∈
I
+
h
h
h
h
y
(
n
)
≥
0
n
∈
I
+
h
h
h
h
w
(
n
)
≥
0
n
∈
I
+
.The optimal solution to the problem will have to satisfy the Karush-Kuhn-Tucker (KKT) conditions, that is, feasibility of the Primal and Dual, as well as complementary slackness [27]. The KKT conditions give the necessary conditions for optimality of the general constrained problem.Checking dual feasibility, for anyu the constraints can be satisfied by construction such that if (
n
-
u
)
>
0, then y
(
n
)
=
0, w
(
n
)
=
(
n
-
u
)
p
C
(
n
-
1
) and if (
n
-
u
)
<
0, then y
(
n
)
=
-
(
n
-
u
)
p
C
(
n
-
1
), w
(
n
)
=
0. This is because the main dual constraint is
(21)
(
n
-
u
)
p
C
(
n
-
1
)
=
w
(
n
)
-
y
(
n
)
.In order to satisfy complementary slackness, ife
S
(
n
)
>
-
δ
S, then it must be true that y
(
n
)
=
0, and if e
S
<
δ
S, then it must be true that w
(
n
)
=
0. In terms of the above primal-dual construction, if e
S
(
n
)
>
-
δ
S, then (
n
-
u
)
>
0 and if e
S
(
n
)
<
δ
S, then (
n
-
u
)
<
0. Any solution e
S
(
n
), n
∈
I
+ and u satisfying the primal constraints and the above two conditions is optimal.Consider the solution(22)
e
S
(
n
)
=
-
δ
S
if
n
<
n
~
C
,
e
S
(
n
)
=
δ
S
if
n
>
n
~
C
,
u
=
n
~
C
,
where n
~
C is the median state at completions.Assume for simplicity that there is an even number of states so thatn
~
C
≠
n for any n. This solution is dual feasible since we showed above that any n is a solution to the dual.Checking primal feasibility, the solution satisfies-
e
S
(
n
)
≤
δ
S and e
S
(
n
)
≤
δ
S.The main constraint is(23)
∑
n
=
1
N
p
C
(
n
-
1
)
e
S
(
n
)
=
-
δ
S
∑
n
<
n
~
C
p
C
(
n
-
1
)
+
δ
S
∑
n
>
n
~
C
p
C
(
n
-
1
)
=
δ
S
[
-
∑
n
<
n
~
C
p
C
(
n
-
1
)
+
∑
n
>
n
~
C
p
C
(
n
-
1
)
]
=
δ
S
[
0
]
since n
~
C is median.Lastly, we check for complementary slackness. Now,e
S
(
n
)
>
-
δ
S when n
>
n
~
C; then n
-
y
>
0 and e
S
(
n
)
<
δ
S when n
<
n
~
C; then n
-
y
<
0. Therefore, complementary slackness holds and the solution is an optimal one.The solution value is(24)
∑
n
=
1
N
n
p
C
(
n
-
1
)
e
S
(
n
)
=
∑
n
<
n
~
C
n
p
C
(
n
-
1
)
(
-
δ
S
)
+
∑
n
>
n
~
C
n
p
C
(
n
-
1
)
(
δ
S
)
.
Set this value equal to Δ
S, which is the overall completer’s average minus the average of the set truncated at the median. This can be shown by first taking
(25)
Δ
S
=
∑
n
<
n
~
C
n
p
C
(
n
-
1
)
(
-
δ
S
)
+
∑
n
>
n
~
C
n
p
C
(
n
-
1
)
(
δ
S
)
.
δ
S times the completer’s average, n
-
C, is
(26)
δ
S
n
-
C
=
∑
n
<
n
~
C
n
p
C
(
n
-
1
)
(
δ
S
)
+
∑
n
>
n
~
C
n
p
C
(
n
-
1
)
(
δ
S
)
.
Subtracting Δ
S yields
(27)
δ
S
n
-
C
-
Δ
S
=
2
∑
n
<
n
~
C
n
p
C
(
n
-
1
)
(
δ
S
)
,
Δ
S
=
δ
S
[
n
-
C
-
2
∑
n
<
n
~
C
n
p
C
(
n
-
1
)
]
.
We know that
(28)
∑
n
<
n
~
C
p
C
(
n
-
1
)
=
1
2
since n
~
C is a median. Therefore,
(29)
∑
n
<
n
~
C
2
p
C
(
n
-
1
)
=
1
,
∑
n
<
n
~
C
n
2
p
C
(
n
-
1
)
=
n
-
C
T
is the average of the set of states truncated at the median. So the bound on e
S
* is
(30)
Δ
S
=
δ
S
[
n
-
C
-
n
-
C
T
]
.As an example, take the behavior sequence in Figure1. If we want to use the OA equation [24]
(31)
n
-
A
S
=
U
1
-
U
-
p
(
N
)
(
1
-
(
N
+
1
)
p
(
N
)
)
to calculate n
-
A
S, which is the average number assuming flow balance, homogeneous arrival, and services, we would be interested in the bound of the difference between n
- and n
-
A
S. We can calculate
(32)
U
=
T
-
T
(
0
)
T
=
5
6
p
(
n
)
=
1
/
3,  and  n
C
=
7
/
4. Assume the maximum error is δ
S
=
3
/
5. If the other assumption errors are zero, then the difference, n
-
-
n
-
A
S is equal to the correction term:
(33)
C
n
-
=
U
1
-
U
-
p
(
N
)
(
1
-
p
(
N
)
)
e
S
*
.
The upper bound on this correction term, using (14), is
(34)
U
1
-
U
-
p
(
N
)
(
1
-
p
(
N
)
)
δ
S
n
-
C
=
-
3.5
.
Using the tighter bound, Δ
S, we get
(35)
U
1
-
U
-
p
(
N
)
(
1
-
p
(
N
)
)
Δ
S
=
-
10
3
(
δ
S
(
n
-
C
-
n
-
C
T
)
)
=
-
10
3
(
3
5
(
7
4
-
1
)
)
=
-
1.5
.
This is a reduction of 57.14%, for this example of the difference bound.Figure 1
Example Behavior Sequence for estimating. Homogeneous service error bound.


### 3.2. Bounds on Homogeneous Arrival Assumption Error

As in the previous section, we can assume that a maximum error,δ
A, for any state is known beforehand. That is, we assume
(36)
|
e
A
(
n
)
|
≤
δ
A
,
n
∈
I
.
Then, the weak overall homogeneous arrival error is bounded by
(37)
e
A
*
≤
∑
n
=
0
N
-
1
n
T
(
n
)
T
-
T
(
N
)
|
e
A
(
n
)
|
≤
δ
A
∑
n
=
0
N
-
1
n
T
(
n
)
T
-
T
(
N
)
≤
δ
A
n
-
N
,
where n
-
N is the average number at the device excluding the maximum state.As with the service errors,e
S
(
n
), the e
A
(
n
) are not independent. The dependency is
(38)
∑
n
=
0
N
-
1
T
(
n
)
T
-
T
(
N
)
e
A
(
n
)
=
0
.
This can be shown by substituting the definition of e
A
(
n
) into the equation. As with the homogeneous service assumptions, we set up the following optimization problem:
(39)
Max
e
A
*
=
∑
n
=
0
N
-
1
n
T
(
n
)
T
-
T
(
N
)
e
A
(
n
)
s
.
t
.
∑
n
=
0
N
-
1
T
(
n
)
T
-
T
(
N
)
e
A
(
n
)
=
0
|
e
A
(
n
)
|
≤
δ
A
n
∈
I
.
Using the Karush-Kuhn-Tucker conditions as before, we can show that with n
~ as the median state
(40)
e
A
(
n
)
=
-
δ
A
if
n
<
n
~
,
e
A
(
n
)
=
δ
A
if
n
>
n
~
,
u
=
n
~
is the solution to the optimization problem. The value of the solution is found by substituting into the primal objective function to get
(41)
Δ
A
=
max
e
A
*
=
∑
n
<
n
~
n
T
(
n
)
T
-
T
(
N
)
(
-
δ
A
)
+
∑
n
>
n
~
N
-
1
n
T
(
n
)
T
-
T
(
N
)
(
δ
A
)
.
δ
A times the average excluding the maximum, n
-
N, is
(42)
δ
A
n
-
N
=
∑
n
<
n
~
n
T
(
n
)
T
-
T
(
N
)
(
δ
A
)
+
∑
n
>
n
~
N
-
1
n
T
(
n
)
T
-
T
(
N
)
(
δ
A
)
.
Subtracting
(43)
δ
A
n
-
N
-
Δ
A
=
2
∑
n
<
n
~
n
T
(
n
)
T
-
T
(
N
)
δ
A
therefore,
(44)
Δ
A
=
δ
A
[
n
-
N
-
2
∑
n
<
n
~
n
T
(
n
)
T
-
T
(
N
)
]
=
δ
A
[
n
-
N
-
2
∑
n
<
n
~
n
p
(
n
)
1
-
p
(
N
)
]
.
The expression
(45)
2
∑
n
<
n
~
n
p
(
n
)
is the average of the values truncated at the median. Call this value n
-
T. Then, substitution yields an upper bound on the error measure due to violations in homogeneous arrivals of
(46)
Δ
A
=
δ
A
[
n
-
N
-
n
-
T
1
-
p
(
N
)
]
.This bound may not be as useful as the bound on the homogeneous service assumption error because the value ofΔ
A is based on knowing the T
(
n
) values, whereas, for Δ
S only completion counts are necessary.


## 3.1. Bounds on Homogeneous Service Assumption Error

Ifδ
S is the maximum error for the homogeneous service assumption, then
(9)
|
e
S
(
n
)
|
≤
δ
S
n
∈
I
+
.
A more useful bound would be on the weak overall homogeneous service error:
(10)
e
S
*
≤
δ
S
*
.
But, this limit may be harder to know beforehand. Equation (9) may be used to find an upper bound on e
S
* by using the definition
(11)
e
S
*
=
∑
n
=
1
N
n
p
C
(
n
-
1
)
e
S
(
n
)
.
Substituting (9) yields
(12)
e
S
*
=
∑
n
=
1
N
n
p
C
(
n
-
1
)
|
e
S
(
n
)
|
≤
δ
S
∑
n
=
1
N
n
p
C
(
n
-
1
)
.
The term
(13)
∑
m
=
1
N
n
p
C
(
n
-
1
)
=
n
-
C
is the average number at the device seen by a completer. Therefore,
(14)
e
S
*
≤
δ
S
n
-
C
.The bound given by (14) does not take into consideration the fact that the e
S
(
n
) values are not independent. In fact, they are related by the expression
(15)
∑
n
=
1
N
p
C
(
n
-
1
)
e
S
(
n
)
=
0
.
We can get a tighter bound of the e
S
* values by taking this dependence into consideration. Equation (15) can be shown by substituting the definition
(16)
e
S
(
n
)
=
S
(
n
)
S
=
1
p
C
(
n
-
1
)
[
T
(
n
)
T
-
T
(
0
)
]
-
1
as follows:
(17)
∑
n
=
1
N
p
C
(
n
-
1
)
e
S
(
n
)
=
∑
n
=
1
N
p
C
(
n
-
1
)
[
1
p
C
(
n
-
1
)
T
(
n
)
T
-
T
(
0
)
-
1
]
=
∑
n
=
1
N
T
(
n
)
T
-
T
(
0
)
-
∑
n
=
1
N
p
C
(
n
-
1
)
=
T
-
T
(
0
)
T
-
T
(
0
)
-
1
=
0
.Since what is desired is an upper bound one
S
* a solution to the optimization problem below will give the desired result:
(18)
Max
e
S
*
=
∑
m
=
1
N
n
p
C
(
n
-
1
)
e
S
(
n
)
s
.
t
.
∑
n
=
1
N
p
C
(
n
-
1
)
e
S
(
n
)
=
0
|
e
S
(
n
)
|
≤
δ
S
n
∈
I
+
.
In order to show the optimal solution, first put this problem in primal and dual forms:primal:(19)
Max
∑
n
=
1
N
n
p
C
(
n
-
1
)
e
S
(
n
)
s
.
t
.
∑
n
=
1
N
p
C
(
n
-
1
)
e
S
(
n
)
=
0
h
:
u
-
e
S
(
n
)
≤
δ
S
n
∈
I
+
:
y
(
n
)
e
S
(
n
)
≤
δ
S
n
∈
I
+
hh
:
w
(
n
)
;
dual:(20)
Min
.
δ
∑
n
=
1
N
(
y
(
n
)
+
w
(
n
)
)
s
.
t
.
p
C
(
n
-
1
)
u
-
y
(
n
)
+
w
(
n
)
=
n
p
C
(
n
-
1
)
n
∈
I
+
h
h
h
h
y
(
n
)
≥
0
n
∈
I
+
h
h
h
h
w
(
n
)
≥
0
n
∈
I
+
.The optimal solution to the problem will have to satisfy the Karush-Kuhn-Tucker (KKT) conditions, that is, feasibility of the Primal and Dual, as well as complementary slackness [27]. The KKT conditions give the necessary conditions for optimality of the general constrained problem.Checking dual feasibility, for anyu the constraints can be satisfied by construction such that if (
n
-
u
)
>
0, then y
(
n
)
=
0, w
(
n
)
=
(
n
-
u
)
p
C
(
n
-
1
) and if (
n
-
u
)
<
0, then y
(
n
)
=
-
(
n
-
u
)
p
C
(
n
-
1
), w
(
n
)
=
0. This is because the main dual constraint is
(21)
(
n
-
u
)
p
C
(
n
-
1
)
=
w
(
n
)
-
y
(
n
)
.In order to satisfy complementary slackness, ife
S
(
n
)
>
-
δ
S, then it must be true that y
(
n
)
=
0, and if e
S
<
δ
S, then it must be true that w
(
n
)
=
0. In terms of the above primal-dual construction, if e
S
(
n
)
>
-
δ
S, then (
n
-
u
)
>
0 and if e
S
(
n
)
<
δ
S, then (
n
-
u
)
<
0. Any solution e
S
(
n
), n
∈
I
+ and u satisfying the primal constraints and the above two conditions is optimal.Consider the solution(22)
e
S
(
n
)
=
-
δ
S
if
n
<
n
~
C
,
e
S
(
n
)
=
δ
S
if
n
>
n
~
C
,
u
=
n
~
C
,
where n
~
C is the median state at completions.Assume for simplicity that there is an even number of states so thatn
~
C
≠
n for any n. This solution is dual feasible since we showed above that any n is a solution to the dual.Checking primal feasibility, the solution satisfies-
e
S
(
n
)
≤
δ
S and e
S
(
n
)
≤
δ
S.The main constraint is(23)
∑
n
=
1
N
p
C
(
n
-
1
)
e
S
(
n
)
=
-
δ
S
∑
n
<
n
~
C
p
C
(
n
-
1
)
+
δ
S
∑
n
>
n
~
C
p
C
(
n
-
1
)
=
δ
S
[
-
∑
n
<
n
~
C
p
C
(
n
-
1
)
+
∑
n
>
n
~
C
p
C
(
n
-
1
)
]
=
δ
S
[
0
]
since n
~
C is median.Lastly, we check for complementary slackness. Now,e
S
(
n
)
>
-
δ
S when n
>
n
~
C; then n
-
y
>
0 and e
S
(
n
)
<
δ
S when n
<
n
~
C; then n
-
y
<
0. Therefore, complementary slackness holds and the solution is an optimal one.The solution value is(24)
∑
n
=
1
N
n
p
C
(
n
-
1
)
e
S
(
n
)
=
∑
n
<
n
~
C
n
p
C
(
n
-
1
)
(
-
δ
S
)
+
∑
n
>
n
~
C
n
p
C
(
n
-
1
)
(
δ
S
)
.
Set this value equal to Δ
S, which is the overall completer’s average minus the average of the set truncated at the median. This can be shown by first taking
(25)
Δ
S
=
∑
n
<
n
~
C
n
p
C
(
n
-
1
)
(
-
δ
S
)
+
∑
n
>
n
~
C
n
p
C
(
n
-
1
)
(
δ
S
)
.
δ
S times the completer’s average, n
-
C, is
(26)
δ
S
n
-
C
=
∑
n
<
n
~
C
n
p
C
(
n
-
1
)
(
δ
S
)
+
∑
n
>
n
~
C
n
p
C
(
n
-
1
)
(
δ
S
)
.
Subtracting Δ
S yields
(27)
δ
S
n
-
C
-
Δ
S
=
2
∑
n
<
n
~
C
n
p
C
(
n
-
1
)
(
δ
S
)
,
Δ
S
=
δ
S
[
n
-
C
-
2
∑
n
<
n
~
C
n
p
C
(
n
-
1
)
]
.
We know that
(28)
∑
n
<
n
~
C
p
C
(
n
-
1
)
=
1
2
since n
~
C is a median. Therefore,
(29)
∑
n
<
n
~
C
2
p
C
(
n
-
1
)
=
1
,
∑
n
<
n
~
C
n
2
p
C
(
n
-
1
)
=
n
-
C
T
is the average of the set of states truncated at the median. So the bound on e
S
* is
(30)
Δ
S
=
δ
S
[
n
-
C
-
n
-
C
T
]
.As an example, take the behavior sequence in Figure1. If we want to use the OA equation [24]
(31)
n
-
A
S
=
U
1
-
U
-
p
(
N
)
(
1
-
(
N
+
1
)
p
(
N
)
)
to calculate n
-
A
S, which is the average number assuming flow balance, homogeneous arrival, and services, we would be interested in the bound of the difference between n
- and n
-
A
S. We can calculate
(32)
U
=
T
-
T
(
0
)
T
=
5
6
p
(
n
)
=
1
/
3,  and  n
C
=
7
/
4. Assume the maximum error is δ
S
=
3
/
5. If the other assumption errors are zero, then the difference, n
-
-
n
-
A
S is equal to the correction term:
(33)
C
n
-
=
U
1
-
U
-
p
(
N
)
(
1
-
p
(
N
)
)
e
S
*
.
The upper bound on this correction term, using (14), is
(34)
U
1
-
U
-
p
(
N
)
(
1
-
p
(
N
)
)
δ
S
n
-
C
=
-
3.5
.
Using the tighter bound, Δ
S, we get
(35)
U
1
-
U
-
p
(
N
)
(
1
-
p
(
N
)
)
Δ
S
=
-
10
3
(
δ
S
(
n
-
C
-
n
-
C
T
)
)
=
-
10
3
(
3
5
(
7
4
-
1
)
)
=
-
1.5
.
This is a reduction of 57.14%, for this example of the difference bound.Figure 1
Example Behavior Sequence for estimating. Homogeneous service error bound.


## 3.2. Bounds on Homogeneous Arrival Assumption Error

As in the previous section, we can assume that a maximum error,δ
A, for any state is known beforehand. That is, we assume
(36)
|
e
A
(
n
)
|
≤
δ
A
,
n
∈
I
.
Then, the weak overall homogeneous arrival error is bounded by
(37)
e
A
*
≤
∑
n
=
0
N
-
1
n
T
(
n
)
T
-
T
(
N
)
|
e
A
(
n
)
|
≤
δ
A
∑
n
=
0
N
-
1
n
T
(
n
)
T
-
T
(
N
)
≤
δ
A
n
-
N
,
where n
-
N is the average number at the device excluding the maximum state.As with the service errors,e
S
(
n
), the e
A
(
n
) are not independent. The dependency is
(38)
∑
n
=
0
N
-
1
T
(
n
)
T
-
T
(
N
)
e
A
(
n
)
=
0
.
This can be shown by substituting the definition of e
A
(
n
) into the equation. As with the homogeneous service assumptions, we set up the following optimization problem:
(39)
Max
e
A
*
=
∑
n
=
0
N
-
1
n
T
(
n
)
T
-
T
(
N
)
e
A
(
n
)
s
.
t
.
∑
n
=
0
N
-
1
T
(
n
)
T
-
T
(
N
)
e
A
(
n
)
=
0
|
e
A
(
n
)
|
≤
δ
A
n
∈
I
.
Using the Karush-Kuhn-Tucker conditions as before, we can show that with n
~ as the median state
(40)
e
A
(
n
)
=
-
δ
A
if
n
<
n
~
,
e
A
(
n
)
=
δ
A
if
n
>
n
~
,
u
=
n
~
is the solution to the optimization problem. The value of the solution is found by substituting into the primal objective function to get
(41)
Δ
A
=
max
e
A
*
=
∑
n
<
n
~
n
T
(
n
)
T
-
T
(
N
)
(
-
δ
A
)
+
∑
n
>
n
~
N
-
1
n
T
(
n
)
T
-
T
(
N
)
(
δ
A
)
.
δ
A times the average excluding the maximum, n
-
N, is
(42)
δ
A
n
-
N
=
∑
n
<
n
~
n
T
(
n
)
T
-
T
(
N
)
(
δ
A
)
+
∑
n
>
n
~
N
-
1
n
T
(
n
)
T
-
T
(
N
)
(
δ
A
)
.
Subtracting
(43)
δ
A
n
-
N
-
Δ
A
=
2
∑
n
<
n
~
n
T
(
n
)
T
-
T
(
N
)
δ
A
therefore,
(44)
Δ
A
=
δ
A
[
n
-
N
-
2
∑
n
<
n
~
n
T
(
n
)
T
-
T
(
N
)
]
=
δ
A
[
n
-
N
-
2
∑
n
<
n
~
n
p
(
n
)
1
-
p
(
N
)
]
.
The expression
(45)
2
∑
n
<
n
~
n
p
(
n
)
is the average of the values truncated at the median. Call this value n
-
T. Then, substitution yields an upper bound on the error measure due to violations in homogeneous arrivals of
(46)
Δ
A
=
δ
A
[
n
-
N
-
n
-
T
1
-
p
(
N
)
]
.This bound may not be as useful as the bound on the homogeneous service assumption error because the value ofΔ
A is based on knowing the T
(
n
) values, whereas, for Δ
S only completion counts are necessary.


## 4. Example Performance Measure Error Bounds

Some examples are given next of howΔ
A and Δ
S may be used to determine bounds on the difference between exact values of various PMs and the OA estimated values for particular behavior sequences.


### 4.1. Arriver’s Average Queue Length

Using the example from the introduction, for a behavior sequence the average queue length seen by an arriving job may be calculated by(47)
n
-
A
=
n
-
A
S
+
C
n
-
A
S
,
Where  C
n
-
A
S
=
e
F
-
e
S
* and n
-
A
S
=
(
n
-
/
U
)
-
1 is the average arriver’s queue length assuming homogeneous services.Rearranging and using theΔ
A bound give
(48)
n
-
A
-
n
-
A
S
=
e
F
-
e
S
*
,
n
-
A
S
-
n
-
A
=
e
S
*
-
e
F
≤
Δ
S
-
e
F
.
Since e
F
→
0 for any sequence of data in steady state, we assume flow balance holds. Then,
(49)
n
-
A
S
-
n
-
A
≤
Δ
S
.
This expression shows us that the difference between estimating the average length seen by arrivers with the relationship that assumes homogeneous servers and the true value of n
-
A is less than or equal to the bound on e
S
*.


### 4.2. Response Time

The exact response time for a behavior sequence can be found by(50)
R
=
R
S
+
C
R
S
,
where  C
R
S
=
-
S
C
n
-
A
S
=
-
S
(
e
F
-
e
S
*
) and R
S
=
S
(
n
-
A
+
1
).Since, as before, we are interested in the difference between a possible observed value (R) and a calculated value (R
S) we should do some rearranging and get R
-
R
S
=
S
(
e
S
*
-
e
F
). Again, assuming e
F is small and substituting e
S
*
≤
Δ
S yield
(51)
R
-
R
S
≤
S
Δ
S
,
R
-
R
S
≤
S
(
δ
S
(
n
-
C
-
n
-
C
T
)
)
.


### 4.3. Average Number at Device

If homogeneous arrivals, homogeneous services, and job flow balance hold then the average number at a device (i.e., those both in queue and in service) can be calculated by(52)
n
-
A
S
=
U
1
-
U
-
p
(
N
)
(
1
-
(
N
+
1
)
p
(
N
)
)
.
The exact average number if these assumptions do not hold is
(53)
n
-
=
n
-
A
S
+
C
n
-
A
S
,
where
(54)
C
n
-
A
S
=
U
1
-
U
-
p
(
N
)
(
1
-
p
(
N
)
)
(
e
A
*
+
e
S
*
-
e
F
)
.
Rearranging again,
(55)
n
-
-
n
-
A
S
=
C
n
-
A
S
=
U
1
-
U
-
p
(
N
)
(
1
-
p
(
N
)
)
(
e
A
*
+
e
S
*
-
e
F
)
and substituting e
A
*
≤
Δ
A, e
S
*
≤
Δ
S, and e
F
=
0 we get
(56)
n
-
-
n
-
A
S
≤
U
1
-
U
-
p
(
N
)
(
1
-
p
(
N
)
)
(
Δ
A
+
Δ
S
)
if 1
>
U
+
p
(
N
) or
(57)
n
-
-
n
-
A
S
≥
U
1
-
U
-
p
(
N
)
(
1
-
p
(
N
)
)
(
Δ
A
+
Δ
S
)
if 1
<
U
+
p
(
N
).Because the calculation ofΔ
A requires knowledge of T
(
n
) values, there may be little benefit in using the right hand side of the above relationship to find this error bound. If, however, the behavior sequence can be assumed to have homogeneous arrivals, then we can get a bound on the average number at a device error without the knowledge of the individual T
(
n
) values. In that case, the only time statistics we need are utilization, U, and the fraction of time spent at the maximum state, p
(
N
).


### 4.4. Throughput

Using the OA version of Little’s Law [1] we can say that the difference between a behavior sequence’s actual throughput and that calculated assuming both homogeneous arrivals and services will be
(58)
X
-
X
A
S
=
n
-
R
-
n
-
A
S
R
A
S
.ForR
A
S, we can substitute R
S which is the more general expression since it does not need the homogeneous arrival assumption. From previous developments we know the following relations hold:
(59)
n
-
=
n
-
A
S
+
C
n
-
A
S
,
where
(60)
C
n
-
A
S
≤
|
U
1
-
U
-
p
(
N
)
(
1
-
p
(
N
)
)
(
Δ
A
+
Δ
S
)
|
and R
=
R
S
+
C
R
S, where
(61)
C
R
S
≤
S
Δ
S
.Substituting into (58) gives
(62)
X
-
X
A
S
=
n
-
A
S
+
C
n
-
A
S
R
S
+
C
R
S
-
n
-
A
S
R
S
=
R
S
C
n
-
A
S
-
n
-
A
S
C
R
S
R
S
(
R
S
+
C
R
S
)
.
If the bound of (60) is substituted into (62), then it must be that
(63)
R
S
|
(
U
/
(
1
-
U
-
p
(
N
)
)
)
(
1
-
p
(
N
)
)
(
Δ
A
+
Δ
S
)
|
-
n
-
A
S
C
R
S
R
S
(
R
S
+
C
R
S
)
≥
R
S
C
n
-
A
S
-
n
-
A
S
C
R
S
R
S
(
R
S
+
C
R
S
)
.
If instead of bound (60), bound (61) is substituted, the numerator can only decrease and the denominator only increase; therefore,
(64)
R
S
C
n
-
A
S
-
n
-
A
S
S
Δ
S
R
S
(
R
S
+
S
Δ
S
)
≤
R
S
C
n
-
A
S
-
n
-
A
S
C
R
S
R
S
(
R
S
+
C
R
S
)
.
If both (60) and (61) are substituted, then the value of the expression must fall within the limits defined by (63) and (64). Therefore, the bounds on our throughput error are
(65)
R
S
C
n
-
A
S
-
n
-
A
S
S
Δ
S
R
S
(
R
S
+
S
Δ
S
)
≤
X
-
X
A
S
≤
R
S
|
(
U
/
(
1
-
U
-
p
(
N
)
)
)
(
1
-
p
(
N
)
)
(
Δ
A
+
Δ
S
)
|
R
S
(
R
S
+
C
R
S
)
-
n
-
A
S
C
R
S
R
S
(
R
S
+
C
R
S
)
.


## 4.1. Arriver’s Average Queue Length

Using the example from the introduction, for a behavior sequence the average queue length seen by an arriving job may be calculated by(47)
n
-
A
=
n
-
A
S
+
C
n
-
A
S
,
Where  C
n
-
A
S
=
e
F
-
e
S
* and n
-
A
S
=
(
n
-
/
U
)
-
1 is the average arriver’s queue length assuming homogeneous services.Rearranging and using theΔ
A bound give
(48)
n
-
A
-
n
-
A
S
=
e
F
-
e
S
*
,
n
-
A
S
-
n
-
A
=
e
S
*
-
e
F
≤
Δ
S
-
e
F
.
Since e
F
→
0 for any sequence of data in steady state, we assume flow balance holds. Then,
(49)
n
-
A
S
-
n
-
A
≤
Δ
S
.
This expression shows us that the difference between estimating the average length seen by arrivers with the relationship that assumes homogeneous servers and the true value of n
-
A is less than or equal to the bound on e
S
*.


## 4.2. Response Time

The exact response time for a behavior sequence can be found by(50)
R
=
R
S
+
C
R
S
,
where  C
R
S
=
-
S
C
n
-
A
S
=
-
S
(
e
F
-
e
S
*
) and R
S
=
S
(
n
-
A
+
1
).Since, as before, we are interested in the difference between a possible observed value (R) and a calculated value (R
S) we should do some rearranging and get R
-
R
S
=
S
(
e
S
*
-
e
F
). Again, assuming e
F is small and substituting e
S
*
≤
Δ
S yield
(51)
R
-
R
S
≤
S
Δ
S
,
R
-
R
S
≤
S
(
δ
S
(
n
-
C
-
n
-
C
T
)
)
.


## 4.3. Average Number at Device

If homogeneous arrivals, homogeneous services, and job flow balance hold then the average number at a device (i.e., those both in queue and in service) can be calculated by(52)
n
-
A
S
=
U
1
-
U
-
p
(
N
)
(
1
-
(
N
+
1
)
p
(
N
)
)
.
The exact average number if these assumptions do not hold is
(53)
n
-
=
n
-
A
S
+
C
n
-
A
S
,
where
(54)
C
n
-
A
S
=
U
1
-
U
-
p
(
N
)
(
1
-
p
(
N
)
)
(
e
A
*
+
e
S
*
-
e
F
)
.
Rearranging again,
(55)
n
-
-
n
-
A
S
=
C
n
-
A
S
=
U
1
-
U
-
p
(
N
)
(
1
-
p
(
N
)
)
(
e
A
*
+
e
S
*
-
e
F
)
and substituting e
A
*
≤
Δ
A, e
S
*
≤
Δ
S, and e
F
=
0 we get
(56)
n
-
-
n
-
A
S
≤
U
1
-
U
-
p
(
N
)
(
1
-
p
(
N
)
)
(
Δ
A
+
Δ
S
)
if 1
>
U
+
p
(
N
) or
(57)
n
-
-
n
-
A
S
≥
U
1
-
U
-
p
(
N
)
(
1
-
p
(
N
)
)
(
Δ
A
+
Δ
S
)
if 1
<
U
+
p
(
N
).Because the calculation ofΔ
A requires knowledge of T
(
n
) values, there may be little benefit in using the right hand side of the above relationship to find this error bound. If, however, the behavior sequence can be assumed to have homogeneous arrivals, then we can get a bound on the average number at a device error without the knowledge of the individual T
(
n
) values. In that case, the only time statistics we need are utilization, U, and the fraction of time spent at the maximum state, p
(
N
).


## 4.4. Throughput

Using the OA version of Little’s Law [1] we can say that the difference between a behavior sequence’s actual throughput and that calculated assuming both homogeneous arrivals and services will be
(58)
X
-
X
A
S
=
n
-
R
-
n
-
A
S
R
A
S
.ForR
A
S, we can substitute R
S which is the more general expression since it does not need the homogeneous arrival assumption. From previous developments we know the following relations hold:
(59)
n
-
=
n
-
A
S
+
C
n
-
A
S
,
where
(60)
C
n
-
A
S
≤
|
U
1
-
U
-
p
(
N
)
(
1
-
p
(
N
)
)
(
Δ
A
+
Δ
S
)
|
and R
=
R
S
+
C
R
S, where
(61)
C
R
S
≤
S
Δ
S
.Substituting into (58) gives
(62)
X
-
X
A
S
=
n
-
A
S
+
C
n
-
A
S
R
S
+
C
R
S
-
n
-
A
S
R
S
=
R
S
C
n
-
A
S
-
n
-
A
S
C
R
S
R
S
(
R
S
+
C
R
S
)
.
If the bound of (60) is substituted into (62), then it must be that
(63)
R
S
|
(
U
/
(
1
-
U
-
p
(
N
)
)
)
(
1
-
p
(
N
)
)
(
Δ
A
+
Δ
S
)
|
-
n
-
A
S
C
R
S
R
S
(
R
S
+
C
R
S
)
≥
R
S
C
n
-
A
S
-
n
-
A
S
C
R
S
R
S
(
R
S
+
C
R
S
)
.
If instead of bound (60), bound (61) is substituted, the numerator can only decrease and the denominator only increase; therefore,
(64)
R
S
C
n
-
A
S
-
n
-
A
S
S
Δ
S
R
S
(
R
S
+
S
Δ
S
)
≤
R
S
C
n
-
A
S
-
n
-
A
S
C
R
S
R
S
(
R
S
+
C
R
S
)
.
If both (60) and (61) are substituted, then the value of the expression must fall within the limits defined by (63) and (64). Therefore, the bounds on our throughput error are
(65)
R
S
C
n
-
A
S
-
n
-
A
S
S
Δ
S
R
S
(
R
S
+
S
Δ
S
)
≤
X
-
X
A
S
≤
R
S
|
(
U
/
(
1
-
U
-
p
(
N
)
)
)
(
1
-
p
(
N
)
)
(
Δ
A
+
Δ
S
)
|
R
S
(
R
S
+
C
R
S
)
-
n
-
A
S
C
R
S
R
S
(
R
S
+
C
R
S
)
.


## 5. Using the PM Bounds

The bounds derived in the previous sections are actually limits on PM correction terms. Assuming we know theδ
A and δ
S values a priori and that we can say something about the homogeneous arrival assumption, then these bounds can be found without knowledge of all the T
(
n
) values for each n. This is the same simplification of data collection that we have in using the OA formulas instead of direct calculations.As an example of using the bounds in a simulation study, assume we are interested in finding an estimate for average number at a device. A series of 10 runs is made and the bound for the correction term,C
n
-, is calculated. If it is positive, we can call this an upper bound. If it is negative, let this be a lower bound. In both cases the other bound is 0. Assume in the simulation runs these bounds always fall between −6 and 3.3. The correction term for each run is approximated by taking the average value between the upper and lower bounds. We would like to be able to say something about the probability that future runs will fall within the [
-
6
,
3.3
] limits that have already appeared. We can do this using tolerance limit calculations.Assume the 10 runs produced the results given in Table2. The average and standard deviation for these observations are −1.34 and 1.55, respectively.Table 2
Example estimated correction terms for average number at a device.
Run
C
n
-
1
−1.75
2
−3.00
3
−1.25
4
1.65
5
−2.50
6
−1.90
7
−1.75
8
1.15
9
−2.60
10
−1.45Since the tolerance limits are going to be set at the observed limits, we can say(66)
[
-
6,3.3
]
=
[
C
n
-
-
K
s
,
C
n
-
+
K
s
]
,
K
=
C
n
-
-
(
-
6
)
s
=
(
3.3
)
-
C
n
-
s
=
3.0
.
From tolerance limit tables [28] we can say with 95% confidence that at least 91% of future observations of C
n
- will fall within the interval [
-
6,3.3
]. That is, if we use n
-
A
S values, we have 95% confidence that the correct n
- values for each run will fall within these limits 91% of the time.


## 6. Conclusion

In this paper, bounds were developed for the operational analysis error measures of homogeneous service and arrival assumptions. These bounds allow us to take advantage of the simplified data collection made possible by the use of operational analysis relationships, even when the assumptions used to derive those relationships are violated. A tolerance limit based method was given in order to be able to say something about the confidence that future correction term values in a time series would be within certain limits.



---

*Source: 460570-2014-01-12.xml*