CC BY
35
Труды Карельского научного центра РАН № 5. 2012. С. 54-60
УДК 519.872.6
PERFORMANCE ANALYSIS OF BRIDGE MONTE-CARLO ESTIMATOR
O. V. Lukashenko1, E. V. Morozov1, M. Pagano2
11nstitute of Applied Mathematical Research of Karelian Research Centre of RAS 2 Dept. of Information Engineering, University of Pisa, Italy
The overflow probability is an important QoS (Quality of Service) parameter. In this paper, we analyze the performance of Bridge Monte-Carlo (BMC), an interesting approach for the estimation of the overflow probability for queueing systems fed by a Gaussian input process.
Key words: Gaussian queue, fractional Brownian motion, overflow probability, estimation.
О. В. Лукашенко, Е. В. Морозов, М. Пагано. АНАЛИЗ ЭФФЕКТИВНОСТИ BMC-ОЦЕНКИ
Вероятность переполнения является важным показателем качества обслуживания. В данной статье мы изучаем качественные свойства BMC-оценки этой вероятности для различных гауссовских входных процессов.
Ключевые c л о в а: гауссовская очередь, дробное броуновское движение, вероятность переполнения, оценивание.
Introduction
We consider a single server queueing system with constant service rate C fed by a Gaussian input, which is defined as follows:
At = mt + Xt, (1)
where constant m > 0 and {Xt, t e T} with
T = {Z+} (or T = {M+}) is a centered
Gaussian process with stationary increments, which describes random fluctuations of the input around its linearly increasing mean. To guarantee stability of such a system we assume that m < C. Let us denote vt := DXt - the variance of Xt. Then the covariance function has the following expression:
rs,t = 2 (vt + Vs — v|t-s|) . (2)
The stationary overflow probability (i.e., the probability that stationary workload Q exceeds some treshold level B) has the following representation [12]:
Poverflow := P(Q ^ B)
= P( sup(At - Ct) ^ B)
V teT )
= p(sup(Xt - <£t) ^ 0^ , (3)
VteT J
where <^t := B + rt, r := C — m > 0.
We consider the following important cases of Gaussian inputs:
1. Fractional Brownian Motion (FBM). In this case vt = t2H, with Hurst parameter H e (0,1) (in the teletraffic framework usually H e (0.5,1), corresponding to traffic processes with long range
0
dependence). It has been shown in [13] that FBM arises as the scaled limit process when the cumulative workload is a superposition of on-off sources with mutually independent heavy-tailed on and/or off periods.
2. Sum of two independent FBMs with vt = t2Hl + t2H2. The use of this model is also motivated by the fundamental result in [13] in case of heterogeneous on-off sources.
3. Integrated Ornstein-Uhlenbeck process (IOU) with vt = t + e-t — 1. IOU is the Gaussian counterpart of the well-known Anick-Mitra-Sondi fluid model [1], and its relevance is further motivated in [8].
Asymptotic regimes
There are no explicit expressions for (3) in case of general Gaussian input (there are some results for specific simple cases like standard Brownian motion). Therefore researches were concentrated on asymptotic analysis and simulation technique in different regimes which are described below.
Large buffer regime
In this regime the overflow probability
pb = P(Q ^ B)
is analyzed for large B. The following logarithmic asymptotic result has been found in [3]:
log Pb ~ — inf
t^o 2
as B —— to, (4)
where f ~ g means f/g — 1 and
B + rt
V (t) =
VVt
Expression (4) means that for sufficiently large values of B
V 2 (t)
Pb “ exp<— in0—
(5)
The so- called most-likely time t of the overflow is the optimizing argument in (4) and (5). For FBM input, time t has the following explicit form
H B 1 — H r ,
implying
VM-(A)"‘ < H )■
(6)
(7)
Calculation of exact asymptotics (which are more informative than log asymptotics) is typically much more difficult problem depending on the Gaussian component X of the input. We refer to [7, 10, 11] where such results can be found.
Many sources regime
Often in a large network the input to a station is typically a superposition of a large number n of the streams generated by the i.i.d. sources. This observation leads to analysis of the so-called many sources regime where the input to a station has a form At = mnt + ^n=i X*, with the i.i.d. centered Gaussian processes {X*} (with stationary increments), and the threshold and capacity are scaled accordingly, i. e., B = nb and C = nc where parameter b > 0 and c corresponds to capacity of a single station. Let now be r := c — m> 0 and <^t = b + rt. Then the overflow probability in the many-source regime becomes:
Pn :=
P ^sup^£ X* — nrtj ^ nb
= P (sup(£ X*—”«) >0)
=d P ^sup (X(n) — <^t) ^ ^ ,
where Xt(n) := i/1/nXt (Xt denotes a generic element of X*). Note that the last expression corresponds to equation (3) with the Gaussian
input component Xt(n).
There are several asymptotic results for the overflow probability. Most of them claim that, under mild conditions, such a probability decays exponentially fast in n. The following results has been proved in [2]:
— lim — n
where
V(t) =
= inf
t>0
b + rt
Vv* ’
v 2(t)
(8
Expression (8) means that for n sufficiently large
Pn « ex^ —n inf 1 t>0
V 2(t)
2
(9)
As in a large buffer regime, the optimizing argument t in (8) is called the most-likely time of the overflow. Result (8) gives only logarithmic
55
n
2
asymptotics. In discrete time the following exact large deviation (LD) asymptotic holds [9]:
Pn
(10)
where
$(x) =
1
-y2/2d
Yt = Xt - ^Xj
(11)
Further, we have
Poverflow := P (sup(Xt - pt) ^ 0 ) VteT /
P sup(Yt + ^tX - pt) ^ 0 V teT
P finf (pt - Yt - ^tXj) < 0
Consider two events:
A = <J JnfC^s - Ys - ^sXf) ^ 0
B = \ tinT ^t [pt- Yt] < x*
Fix any u G A and let s* = argmin(ps - Ys -•0sXt). Note that the event A is not empty since
Pt - Yf - = 0.
Then
Ps* — Ys* (u) — ^s* X*(u) ^ 0.
Thus, the following inequality holds
For other exact asymptotics we refer to [4]. BMC ESTIMATOR
Bridge Monte-Carlo (BMC) is a new approach to estimation of the overflow probability in a queueing system with Gaussian input.
Originally proposed by some of the authors in [5], BMC is based on the idea of expressing the overflow probability as the expectation of a function of the Bridge Y := {Y} of the Gaussian input process X, i.e., the process obtained by conditioning X to reach a certain level at some prefixed time t:
tinf ^t [pt - Yt(u)] < ^S* [Ps* - Ys* (u)] < Xt(u).
That is u G B, and hence A C B. Similarly, we can check that B C A. It means that A = B. Denote
Y := inf Pt - Yt. (12)
teT ^t
Recall that
Xt = N(0, rt,t) =d /T^ N(0, 1),
where =d stands for stochastic equivalence. Then, the overflow probability can be rewritten as follows
Poverflow =
P (Y < Xf) = / P(Xf ^ u)P(Y G du)
JR
)p(Y g du)
where function ^t is expressed via covariance function r as
i rt,t ^t := .
r t,t
Because the variance of the input is increasing function of t in all models we consider in the paper, it is easy to see that ^t > 0 for all t G T. Moreover, we note that the process Y is independent of XT since
rtt
E[XfYt] = r,t - rttrj)t = 0.
r t,t
E
RP iN <0-11> TO
$
where independence Y and Xf is used. Given an
—(i)
i.i.d sequence {Y , i = 1,...,N} distributed as Y, the estimator of Poverflow is defined as follows:
1
N
Poverflow : Poverflow(N) N ^ y $
Y (i)
i=1
In spite of the fact that the BMC estimator is not asymptotically efficient, its variance is lower than for the single-twist Importance Sampling (which is comparable in the terms of computational complexity) [6]. Moreover, the approach using BMC estimator is extremely flexible since it does not rely on a change of measure. Furthermore, to apply this estimator the knowledge of the correlation structure of the incoming traffic is only required. (As we mentioned above the assumption of the Gaussianity of Xt is typically fulfilled when a lot of flows are multiplexed together.) Although the choice of t is arbitrary, in the following we will always assume that t = t,
i.e. as the conditioning point we will consider the most-likely time of the overflow. For a wide range of values of the queue parameters, the minimum in (12) is almost always attained near the most-likely time and does not vary significantly. Let us denote
G(t) := Pt - Yt.
■0t
e
and note that G(f) = pf is deterministic.
—(i)
Assume that Y G [pT - h, pT], where evidently the span h depends on the samples {Y(i), i = 1,...,N}. Then by the monotonicity of the tail distribution $,
$
pT
Consider the difference
= $( \TpT^) - $
which can be approximated as
pT
A(h)
pT
TrT
h
Vt;
\/2n
=-Z2/2
h
(14)
where Z =
x/friT'
Actually if the distance
uses N = 106 sample paths and is compared with the exact asymptotic given by (10). The following parameters are used in simulation: r = 0.1; b = 0.3; H = H1 = 0.8; H2 = 0.6. As figures show, a good consistency between theoretical values and simulation results are obtained over a wide range of the overflow probability values.
A between lower and upper bound in (13) is not too large, we can estimate the accuracy of approximation (10). We note that V(t= , so expression (10) indeed gives only lower
bound of Poverflow. Below we verify the accuracy of approximation (10) by simulation.
Simulation results
In this section, a few numerical results are presented which demonstrate the properties and accuracy of the BMC estimator.
We first show the accuracy of the BMC estimator for the different input processes, by comparing the simulation results with the known asymptotics (both for large buffer regime and for many sources regime).
Then we investigate the properties of the BMC estimator from an analytical point of view, taking into account the dependence of the conditional overflow probability from the simulated sample paths of the input process in the case of FBM traffic.
Comparison with asymptotic results
The first set of simulations compares the estimates of BMC with the asymptotic expressions recalled above.
Figures 1-3 refer to many sources regime for different input processes: FBM, sum of independent FBMs and IOU, respectively. In all cases the estimation of the overflow probability
Fig. 1. Simulation vs. asymptotic (10): FBM
Fig. 2. Simulation vs. asymptotic (10): the sum of two independent FBMs
Fig. 3. Simulation vs. asymptotic (10): IOU
57
1
Moreover, for FBM input Figure 4 shows the behavior of the relative error of the BCM estimator (defined as the ratio between the empirical standard deviation and the corresponding probability). Although the relative error is not bounded (indeed, BMC is not even asymptotically efficient [6]), it grows slowly, and for the overflow probabilities of the order of 10-12 (compare the values in figures 1 and 4) is still less than 1 %.
n
Fig. 4. Relative Error for FBM
Finally, figure 5 refers to the large buffer regime and compares the LD bound (5) with the simulation results in the case of a single FBM (with H = 0.8 as before) process. In this case B goes from 10 to 100 and r = 1, considering N = 104 sample paths (the choice is motivated by the relative high values of the simulated probability).
b
Fig. 5. Simulation vs. asymptotic (5) for FBM
Performance analysis of BMC
(14), in order to understand the goodness of the asymptotic approximation (10).
The tests are performed considering a single FBM flow in the many sources regime and using the same parameters as in previous section.
—(i)
To give a visual idea of the variability of Y , figure 6 compares its first 1000 samples with the theorethical upper bound G(t) = pT for n = 500 FBM sources.
As highlighted in the figure, in this example h « 0.298 is not significantly lower than
pT = 1.5, confirming the goodness of the LD approximation (10).
___(i)
Fig. 6. Simulation results for Y
To better understand the variability of Y, figures 7-10 shows the empirical distribution of
Y for different values of n. As expected, for large values of n, Y is concentrated near G(t) = 1.5, and this fact gives a formal motivation for the analysis of A in (14).
0.2 |-----1-----1------------1-------1-----1----p=-----1
0.18 - -
0.16 - -
^ 0.14 - ^____ -
o
§ 0.12 - I -
& 1--
CD
UL 0.1 - -
<D I---
;§ 0.08 - -
0.04
0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6
The second set of simulations aimed at Fig. 7. Histogram of the distribution of Y (n = 50)
checking the variability of h, and hence of A in
0 0.2 0.4 0.6 0.
1 1.2 1.4 1.6
Fig. 8. Histogram of the distribution of Y (n = 100)
function $ in (13) is h— and comparably small.
y rT)T
It shows that approximation (14) can be applied.
Fig. 9. Histogram of the distribution of Y (n = 500)
0 0.2 0.4 0.6
1 1.2 1.4 1.6
Fig. 10. Histogram of the distribution of Y (n = 2000)
For sake of completeness, figure 11 shows the
—(i)
variation of Y for FBM in the large buffer regime (buffer size b = 2000) and the following values of the system parameters: H = 0.8; r = 1; N = 103. In this example h ^ 658.941, but the ratio
0.497. Thus, inspite of that h is
rather large, the increment of the argument of
Fig. 11. Simulation results for Y
Conclusions
In this paper, we have analyzed the main properties of BMC estimator, a simulation approach that exploits the Gaussian nature of the input process and relies on the properties of Bridges.
Several sets of simulations were carried out in order to compare the estimations with well-known asymptotic bounds for different input processes and in different working conditions, considering large buffers as well as the superposition of many i.i.d. sources.
Focusing on the latter scenario, we investigated the empirical distribution of the estimates and the dependence of the conditional overflow probability from the simulated sample paths of the bridge process, in order to understand the applicability of asymptotic results. The simulations highlighted that the shape of the histograms strongly depends on the number of multiplexed sources, confirming the well-known heuristic that rare event happens in the more likely way.
This work is supported by the strategic development program of Petrozavodsk State University for 2012-2016 and Russian Foundation for Basic research, project N 10-0700017.
References
1. Addie R., Mannersalo P., Norros I. Most probable paths and performance formulae for buffers with Gaussian input traffic // European Transactions in Telecommunications. 2002. Vol. 13. P. 183-196.
59
2. Botvich D, Duffield N. Large deviations, the shape of the loss curve, and economies of scale in large multiplexers // Queueing Systems. 1995. Vol. 20. P. 293-320.
3. Debicki K. A note on LDP for supremum of Gaussian processes over infinite horizon // Stat. Probab. Lett. 1999. Vol. 44. P. 211-220.
4. Debicki K., Mandjes M. Exact overflow asymtotics for queues with many Gaussian inputs. Report PNA-R0209 March 31, 2002.
5. Giordano S., Gubinelli M., Pagano M. Bridge Monte-Carlo: a novel approach to rare events of Gaussian processes // Proc. of the 5th St. Petersburg Workshop on Simulation. St. Petersburg, Russia, 2005. P. 281-286.
6. Giordano S., Gubinelli M., Pagano M. Rare events of Gaussian processes: a performance comparison between Bridge Monte-Carlo and Importance Sampling. In Next Generation Teletraffic and Wired/Wireless Advanced Networking. St. Petersburg, Russia, 2007. P. 268280.
7. HUsler J, Piterbarg V. I. Extremes of a certain class of Gaussian processes // Stochastic Processes and their Applications. 1999. Vol. 83. P. 257-271.
СВЕДЕНИЯ ОБ АВТОРАХ:
Лукашенко Олег Викторович
аспирант
Институт прикладных математических исследований Карельского научного центра РАН ул. Пушкинская, 11, Петрозаводск, Республика Карелия, Россия, 185910 эл. почта: [email protected] тел.: (8142) 763370
Морозов Евсей Викторович
ведущий научный сотрудник
Институт прикладных математических исследований Карельского научного центра РАН ул. Пушкинская, 11, Петрозаводск, Республика Карелия, Россия, 185910 эл. почта: [email protected] тел.: (8142) 763370
Пагано Микеле
профессор
факультет информационной инженерии Университета
г. Пизы, Италия
эл. почта: [email protected]
тел.: +39 050 2217575
8. Kulkarni V., Rolski T. Fluid model driven by an Ornstein-Uhlenbeck process // Probability in the Engineering and Informational Sciences. 1994. Vol.
8. P. 403-417.
9. Likhanov N., Mazumdar R. Cell loss asymptotics in buffers fed with a large number of independent stationary sources // Journal of Applied Probability. 1999. Vol. 36. P. 86-96.
10. Massoulie L., Simonian A. Large buffer asymptotics for the queue with FBM input
// Journal of Applied Probability. 1999. Vol. 36. P. 894-906.
11. Narayan O. Exact asymptotic queue length distribution for fractional Brownian traffic
// Advances in Performance Analysis. 1998. Vol. 1. P. 39-63.
12. Reich E. On the On the integrodifferential equation of Takacs I. // Ann. Math. Stat. 1958. Vol. 29. P. 563-570.
13. Taqqu M. S., Willinger W., Sherman R. Proof of a fundamental result in self-similar traffic modeling // Computer communication review. 1997. Vol. 27. P. 5-23.
Lukashenko, Oleg
Institute of Applied Mathematical Research, Karelian Research Centre, Russian Academy of Sciences 11 Pushkinskaya St., 185910 Petrozavodsk, Karelia, Russia
e-mail: [email protected] tel.: (8142) 763370
Morozov, Evsey
Institute of Applied Mathematical Research, Karelian Research Centre, Russian Academy of Sciences 11 Pushkinskaya St., 185910 Petrozavodsk, Karelia, Russia
e-mail: [email protected] tel.: (8142) 763370
Pagano, Michele
Associated Professor
Department of Information Engineering,
University of Pisa, Italy e-mail: [email protected] tel.: +39 050 2217575
