We have already seen the benefits of the ADT policy when the load is
not exactly known (static robustness). One might also expect that, even when the load is known
exactly, the ADT policy might significantly
improve upon the T1 policy with respect to mean response
time. Earlier work of Ahn et al. and Meyn provides some support for this
expectation [4,125]. For example, Meyn shows via numerical examples that, in the
case of finite buffers for both queues, the policy that minimizes
mean response time is a ``flexible'' T1 policy which
allows a continuum of T1 thresholds, , where threshold
is used when the length of queue 2 is
[125].
The ADT policy can be seen as an approximation of a ``flexible'' T1 policy,
using only two
thresholds.
|
To evaluate the benefit of the ADT policy, we compare it over
a range of against the T1 policy optimized for the given
.
Since the search space of the threshold values for the ADT
policy is large, we find locally optimal threshold values,
which are found to be optimal
within a search space of
for each threshold.
We measure the percentage change in the mean response time of ADT versus T1:
Figure 7.11 shows the percentage reduction in the
mean response time of the locally optimized ADT policy over the T1
policy optimized at each , as a function of
.
The parameter settings are exactly the same as those in Figure 7.6(b).
Figure 7.11 shows that,
surprisingly, the benefit of the ADT policy
is quite small with respect to mean response time under fixed Poisson arrivals;
the improvement of the
ADT policy is larger at moderately high
and at smaller
value, but overall the improvement is typically within 3%.
We conjecture that adding more thresholds (approaching the flexible
T1 policy) will not improve mean response
time appreciably, given the small improvement from one to two
thresholds.
Thus, whereas the ADT policy has significant benefits over the simpler
T1 policy with respect to static robustness,
the two policies are comparable with respect to mean response time.