Contents Telektronikk - Telenor
Contents Telektronikk - Telenor
Contents Telektronikk - Telenor
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
advantage is that it is generally very difficult<br />
to identify the conditioning quantity<br />
with an expectation that can be found<br />
analytically.<br />
5 Statistical variance<br />
reduction<br />
Another approach to speed-up simulation<br />
is to use some statistical property of the<br />
model to gain variance reduction. These<br />
“family” of techniques exploit some statistical<br />
properties to reduce the uncertainty<br />
in the output estimates and hence<br />
lessen the variance. This section presents<br />
a handful of variance reduction techniques<br />
that are reported in the literature<br />
more or less applicable to communication<br />
network simulations; antithetic<br />
sampling, common random numbers,<br />
control variables, stratified sampling,<br />
importance sampling, and RESTART.<br />
All, except the latter, are described in<br />
[16]. The RESTART method [17,18] is<br />
specifically developed for solving rare<br />
events in queuing systems like in ATM.<br />
The first three belong to a class of methods<br />
which exploits dependencies between<br />
observations to minimise the variance,<br />
while the latter three provoke<br />
events of interest by manipulating the<br />
underlying process in some way.<br />
First, to give an indication of the effectiveness<br />
of the various methods, a simple<br />
reference example is introduced. A comparison<br />
study of the provoking event<br />
methods is conducted and reported at the<br />
end of this section.<br />
5.1 Reference system<br />
A very simple example is introduced to<br />
give a relative comparison of the speedup<br />
techniques, and compare them to a<br />
direct (“brute-force”) simulation where<br />
none of the novel statistical variance<br />
reduction techniques are applied. The<br />
reference system has a well known and<br />
Table 1 Parameters and key results for the 3 example<br />
cases<br />
Case N λ µ cycle time a P(N) b<br />
I 4 0.05 1 21.053 2.9688 x 10 -7<br />
II 6 0.05 1 21.053 7.4219 x 10 -10<br />
III 85 0.8 1 6.25 9.2634 x 10 -10<br />
a The time from leaving state 0 until next time state 0 is<br />
left.<br />
b Probability of observing the system in state N.<br />
198<br />
simple solution, see e.g. [19], and the<br />
simulation study in this article is of illustration<br />
purpose only.<br />
It can be interpreted in either of the two<br />
following ways:<br />
(i) Queuing system (M/M/1/N-1)<br />
λ<br />
µ -1<br />
N-1 queueing size<br />
The queuing system have a buffer size<br />
of N - 1, which means that up to N customers<br />
can be in the system at the<br />
same time. The performance measure<br />
of interest is the probability of having<br />
a full system (i.e. N simultaneous customers).<br />
If this probability is very<br />
small, it causes problems in evaluation<br />
by direct simulation.<br />
If the system is restricted to Poisson<br />
arrivals with rate λ and service time<br />
following a exponential distribution<br />
with mean µ -1 , an analytic solution can<br />
easily be obtained.<br />
(ii) Highly dependable 1-of-N system<br />
1 2 3 N<br />
Consider a system of N components<br />
where only 1 is active at the time. If<br />
this component fails, the system<br />
switches over to a non-failed or repaired<br />
component, as illustrated in the figure<br />
above. Only the active component<br />
is sustainable to failure, and only one<br />
component can be repaired at the time.<br />
The system fails when all components<br />
have failed. The probability of a system<br />
failure is very low, and causes the<br />
same simulation problems as in (i).<br />
λ<br />
0 1 2<br />
The failures are considered as stemming<br />
from a Poisson-process with a<br />
rate of λ, and the repair times are<br />
exponentially distributed with mean<br />
µ -1 .<br />
A model of these reference systems is<br />
described by a state diagram, see Figure<br />
4. A state is either (i) the number of customers<br />
in the system, or (ii) the number<br />
of failed components. The arrows between<br />
the states show the possible transitions,<br />
with the rate indicated at the top of<br />
each arrow.<br />
The performance measure is either (i) the<br />
probability of having a full system (N<br />
simultaneous customers), or (ii) the probability<br />
of N failed components. In either<br />
case this is equal to the probability of<br />
being in state N and in both cases this<br />
probability in question is extremely low.<br />
In Table 1 you find the parameter settings<br />
for the 3 cases used in this section,<br />
including key results such as the probability<br />
of full system, P(N).<br />
5.2 Variance minimising<br />
All variance reduction techniques in this<br />
subsection are based on the idea of<br />
exploiting dependencies between observations<br />
to reduce the resulting variance.<br />
5.2.1 Correlated samples<br />
Two simple approaches try to obtain correlation<br />
between the samples by offering<br />
complementary input streams to the same<br />
model, or the same stream to alternative<br />
models. Both antithetic sampling and<br />
common random numbers are easy in<br />
use, e.g. antithetic sampling is a built-in<br />
construct in the DEMOS class [20,21]<br />
over SIMULA [22]. Both are exploiting<br />
the fact that the variance to a sum of<br />
random variables are reduced if they are<br />
pairwise negatively correlated.<br />
5.2.1.1 Antithetic sampling<br />
Antithetic sampling performs two complementary<br />
input samples to get two negatively<br />
correlated outputs.<br />
λ λ λ<br />
µ µ µ µ<br />
Figure 4 State diagram description of the model of the reference system<br />
N