HEAVY LOAD QUEUEING ANALYSIS WITH LRD ON=OFF SOURCES F.. In contrast with the classical heavy loadapproximation, note that the limit input rate process obtained this way is generallynon-
Trang 1HEAVY LOAD QUEUEING ANALYSIS WITH LRD ON=OFF SOURCES
F BRICHET ANDA SIMONIAN
France TeÂleÂcom, CNET, 92794 Issy-Moulineaux CeÂdex 9, France
More precisely, represent an on=off source by mutually independent, alternatingsilence periods A and activity periods B When active, the source emits data atSelf-Similar Network Traf®c and Performance Evaluation, Edited by Kihong Park and Walter Willinger ISBN 0-471-31974-0 Copyright # 2000 by John Wiley & Sons, Inc.
115
Self-Similar Network Traf®c and Performance Evaluation, Edited by Kihong Park and Walter Willinger
Copyright # 2000 by John Wiley & Sons, Inc Print ISBN 0-471-31974-0 Electronic ISBN 0-471-20644-X
Trang 2constant rate, its peak rate, taken as unity Given E A 1=a and E B 1=b, theactivity probability of a source is then n a= a b and we require that C > Nn sothat the queue has a stationary regime Provided that the probability density ofduration A B satis®es a simple regularity condition, we ®rst show in this chapterthat, once properly centered and normalized, the aggregate input rate and traf®cprocesses produced by the superposition of N i.i.d on=off sources converge as
N " 1 toward continuous Gaussian processes This is the content of our
``functional central limit'' theorems In contrast with the classical heavy loadapproximation, note that the limit input rate process obtained this way is generallynon-Markovian for arbitrary distributions of on and off durations A and B.Denote further by V0 Nthe corresponding queue content in stationary conditions.Our essential aim is to obtain estimates for the limiting distribution of V0 N as
N " 1, the capacity C scaling with N as
for some positive constant g Equation (5.1) is clearly identi®ed as a heavy loadcondition since the queue load Nn=C tends to 1 for increasing N (with speed1=pN Now, by considering so-called heavy-tailed distributions for on and=oroff periods, the input process becomes long-range dependent (LRD) Based on theabove convergence results for input processes, our analysis then subsequentlyshows that the tail of the limiting distribution of the scaled queue content
V0 N=pN is not exponential but Weibullian Speci®cally, de®ning
limN"1P V0 N> xpN h x
for any ®xed x 0, we have
limx"1
1
x2 1 H log h x k22where both constants k and H 2 1
2; 1 depend on the distributions of on and offdurations Weibullian tails imply ®nite moments of all orders but, nonetheless,necessitate buffer sizes that grow much faster with load than in the classicalMarkovian case since the exponent 2 1 H is strictly less than 1 for H >1
2.Such a result reminds one of the Weibullian nature of the distribution of a ¯uidqueue fed by the so-called fractional Brownian motion (FBM), as discussed inNorros [13] (see Chapter 4 in this volume for a full account) We also show in thischapter how the limit input processes obtained as N " 1 can easily be related tothe FBM by means of proper time and space scale changes
Other heavy load queueing analysis with heavy-tailed distributions has beenconsidered in related contexts such as the M=G=1 discrete queue (see Chapter 6 inthis volume) and the ¯uid queue with M=G=1 input rate process (refer to Chapter 9
in this volume and references contained therein) In comparison to the analysis
Trang 3performed in Chapters 6, 9 and 10, we stress the fact that the limit considered here,with many small sources and heavy load queueing regime, enables the derivation ofcontinuous limit processes together with the Weibullian queueing behavior, asopposed to the heavy-tailed queueing behavior obtained when ®xed ``source peakrate=total output rate C'' ratio and a ®nite number of sources are considered.The rest of the chapter is organized as follows Section 5.2 contains somepreliminary notation and basic properties related to the on=off source model InSection 5.3, we state and prove functional central limit theorems (CLTs) for theproperly scaled input processes as the number of sources tends to in®nity In Section5.4, these CLTs are used to derive general limiting upper and lower bounds for thestationary distribution of the queue content V0 N under the heavy load condition(5.1) Section 5.5 addresses the impact of long-range dependence on these bounds,demonstrating their Weibullian behavior in this case and relating the present model
to FBM as considered in Chapter 4 Much of the material presented in this chapterwas ®rst published in Brichet et al [5] Alternative arguments for convergenceresults can also be found in Kurtz [10]
5.2 PRELIMINARY PROPERTIES OF THE ON/OFF SOURCE MODELLet fltgt0 be the stationary process representing the input rate of a single on=offsource at time t and ot0tlsds the input it generates in the interval 0; t Wedenote fL Nt g and fWt Ng the sum of N i.i.d copies of the processes fltg and fotg,respectively For ®xed t; ltis a Bernoulli variable with mean n and variance
ma t E otjl0 0; mb t E otjl0 1 5:5associated with ot Finally, we denote by r the covariance function of process fltgde®ned for t 0 by
r t E l0 n lt n E l0lt n2: 5:65.2 PRELIMINARY PROPERTIES OF THE ON/OFF SOURCE MODEL 117
Trang 4Using basic renewal properties of the on=off rate processes, it can easily be shownthat the Laplace transform of covariance function r is given by
5.3 FUNCTIONAL CENTRAL LIMIT THEOREMS
The aim of this section is to ®nd suf®cient conditions for the rate and input processesassociated with the on=off sources to satisfy functional CLTs To this end, we ®rstestablish (Theorem 5.3.1) a CLT for renewal processes, using standard results onweak convergence [3] The desired results are then obtained in Section 5.3.2
5.3.1 CLT forRenewal Processes
For any interval I of R, let d I denote the space of right-continuous functions on Iwith left limits In the sequel, real-valued processes on some interval I areconsidered as d I-valued random elements For bounded I; d I is endowedwith the J1-Skorokhod topology The space d R, denoted by d for short, isendowed with the topology of convergence in the J1topology on bounded intervals.Theorem 5.3.1 Let L be a stationary renewal process, withL 0; t representingthe number of renewal points within time interval 0; t; t 0, and with®nite andnonzero mean intensity l Denoting by P the distribution function of the inter-renewal times, we assume that:
the density P0exists and is bounded in some neighborhood of 0: 5:8Then, given a sequence fLjgj0 of i.i.d copies of L, the sequence of processes
fL NgN>0 de®ned by
L N t 1
N
p PNj1 Lj 0; t lt; t 2 R; 5:9
is tight and converges weakly to a limiting Gaussian process with a.s continuouspaths as N " 1
In order to prove Theorem 5.3.1, the following results are needed The ®rst one istaken from Billingsley [3]
Trang 5Theorem 5.3.2 [3, Theorem 15.6, p 128] Let I 0; T be some boundedinterval of R For a sequence fG NgN>0 of d I-valued processes to convergeweakly to the d I-valued process G, it is suf®cient that:
for all t1; ; tn2 I, the vector G N t1; ; G N tn converges weakly to
G t1; ; G tn, as N " 1;
there exists p > 0, q > 1 and a continuous nondecreasing function F suchthatEjG N t G N t1jp jG N t2 G N tjp F t2 F t1q 5:10for all N and 0 t1 t t2 T
The proof of Lemmas 5.3.3 and 5.3.4 below are deferred to Sections 5.7.1 and 5.7.2.Lemma 5.3.3 Let L be a stationary renewal process satisfying (5.8) Let a0> 0denote an upper bound of the density P0in some neighborhood of 0 Then for smallenough E > 0, process L can be constructed on the same probability space as ahomogeneous Poisson process M with intensity m l= 1 lE _ a0= 1 a0E sothat with probability one, the paths of M dominate those of L on 0; E; that is,
L t M t; t 2 0; E:
Lemma 5.3.4 In the setting of Theorem 5.3.1, let
P N t1; t; t2 EjL N t L N t1j2 jL N t2 L N tj2 5:11for 0 t1 t t2, where the process L N is de®ned by Eq (5.9) It holds that
P N t1; t; t2 2fE x2Z2 E x2E Z2 E xZ2g; 5:12where the random pair x; Z is distributed as L t1; t l t t1, L t; t2
Trang 6Kolmogorov's regularity criterion, that a version of G exists with almost surelycontinuous paths The version is thus a d-valued random element.
We now show that for any interval I 0; T, condition (5.10) of Theorem 5.3.2
is met Let E be ®xed as in Lemma 5.3.3 Let t1 t t2 lie in I If t2 t1 E,Condition (5.10) is met with p q 2 and F x pdx, in view of (5.13) Itremains to ®nd a suitable bound on P N t1; t; t2 when t2 t1> E Using the basicinequality 2jabj a2 b2 in conjunction with the Cauchy±Schwarz inequality,(5.12) entails that
i1jaijn, each of the means in the preceding bound isless than dT=Ee dT=Ee4m4 dT=Ee5m4 One thus obtains
P N t1; t; t2 6fdT=Ee5m4 lT4g:
Denoting the latter upper bound by K, t2 t1 E then entails that
P N t1; t; t2 EK2 t2 t12:Thus condition (5.10) of Theorem 5.3.2 is met, with p q 2 and F x
d _ k=E2
p
5.3.2 CLT forRate and Input Processes
The propositions to follow state the functional CLT for the two sequences ofprocesses fL Nt g and fWt Ng introduced in Section 5.2
Proposition 5.3.5 Let A B denote the total duration of two successive on and offperiods of rate process fltg and assume that the distribution of A B has a boundeddensity in the neighborhood of 0 The sequence of processes Y N de®ned by
Trang 7Proof Write ®rst Eq (5.14) as
Yt N 1
N
p PN
where the flj;tg are i.i.d copies of the process fltg In view of the ordinary CLT, the
®nite-dimensional distributions of the process Y N converge weakly to limitingGaussian distributions Weak convergence of the sequence fY NgN>0will then holdprovided it is tight Since L Nis the superposition of N i.i.d on=off rate processes ljwith peak rate 1, Eq (5.15) entails that
Yt N Y0 N 1
N
p PNj1fL
j 0; t Lj 0; tg 5:16for t 0, where L
j 0; t (resp Lj 0; t is the number of upward (resp downward)jumps of process ljover time interval 0; t Each point process L
j (resp Lj) is astationary renewal process with intensity l, where 1=l 1=a 1=b is the mean cycleperiod of each process lj We therefore deduce from Eq (5.16) that
Yt N Y0 N L N t L N t; 5:17where
L N t 1
N
p PNj1fL
j 0; t ltg:
In view of decomposition (5.17), in order to prove the tightness of the sequence
fY Ng, it is suf®cient to show that each sequence fY0 Ng, fL N g, and fL Ng is tight.The sequence fY0 Ng converges in distribution and is therefore tight Tightness ofboth sequences L N and L N follows from Theorem 5.3.1 Since the weak limits ofboth sequences have a.s continuous paths, it results that the weak limit of Y Nalsohas a.s continuous paths Finally, stationarity of each process Y N ensures
The following result on the convergence of the normalized input process can bededuced as a simple corollary of the previous proposition
Proposition 5.3.6 In the framework of Proposition 5.3.5, the sequence ofprocesses fO Nt g de®ned by
Trang 8converges weakly toward a zero-mean, continuous Gaussian process fOtg withstationary increments and O0 0 In addition, this process is such that
limt!1
with Y N introduced in Eq (5.14) The mapping j, which associates to some
f 2 d 0; T the integrated function j f : t 7 !0tf u du, is continuous on thesubset C 0; T of d 0; T consisting of continuous functions (indeed, this holdssince the trace of the J1-Skorokhod topology on C 0; T coincides with thetopology of uniform convergence; see Billingsley [3]) As Y N converges weakly
to a limiting process Y with a.s continuous paths, O N j Y N converges weakly
to j Y Process Y being Gaussian and centered, the limit process O is clearlycentered, continuous, and Gaussian with O0 0 The stationarity of increments of O
is readily deduced from the stationarity of process Y In view of such stationarity, theergodic theorem can be used to yield the existence of an almost sure limit for Ot=t as
t ! 1 This limit is necessarily a Gaussian random variable, and we will be done
if its variance is equal to zero This variance is equal to (see Eq (5.32))
limt!1
r t nP lt 1jl0 1 n2;
we conclude that r t indeed goes to zero as t ! 1 j5.4 QUEUE CONTENT DISTRIBUTION IN HEAVY LOAD CONDITIONUsing the above convergence results for both the normalized rate process and theinput process created by the superposition of a large number of on=off sources, wecan now assert general limit bounds for the distribution of the normalized queue
Trang 9content V0 N=pN when N " 1 and heavy load condition (5.1) is ful®lled Toderive such limits, ®rst recall [2] that the stationary queue content V0 N can bede®ned as the supremum of the transient process fWt N Ctg, namely,
V0 N sup
Second, given a ¯uid queue with output rate g, it has been shown [16] that, providedthe input process fOtgt0 is such that (1) Ot0tYudu for all t, where the rateprocess fYtgt0 is stationary, and (2) Ot gt tends to 1 almost surely as t " 1,then, for any x 0, the corresponding stationary distribution of the queue content
U0 veri®es the bounds
supt>0P Ot> x gt P U0> x;
h x lim
N"1P V0 N> xpNfor any x 0, the bounds
q x h x Q x
Trang 10hold with
q x supt>0 F x gt D t ; 5:22where F 1 F and
Proof First, using the scaling condition (5.1) for C together with notation(5.18), relation (5.19) for V0 N reads
V0 N
N
p supt>0 O Nt gt:
Let f denote the map d 2 d 7 ! f d supt>0 dt gt From the weak gence of processes O N toward process O, one can conclude that
conver-V0 N=pN f O N converges weakly to U0 f O provided the distribution of
O puts no mass on the set of trajectories d 2 d for which f is discontinuous Thefact that O has a.s continuous paths and is such that Ot=t ! 0 a.s., as implied byProposition 5.3.6, is suf®cient to conclude that this is so (the detailed argument isleft to the reader) It therefore follows that, for ®xed x 0, P V0 N> xpN !
my t Cov Y0; Ot Var Yy
0 E Y0Ot
y
Trang 11E Y0Ot s2m t by deconditioning with respect to the centered variable Y0 Itconsequently follows from the above discussion and relations (5.25) and (5.26) that
my t m ty; D t2 D t2 m t2s2: 5:27Using Eq (5.27) in upper bound (5.20), we then obtain
5.5 IMPACT OF LONG-RANGE DEPENDENCE
We now wish to introduce long-range dependence into the source model and deriveexplicit estimates of bounds q x and Q x of Proposition 5.4.1 for such a case Asshown below, a natural way to do this is to assume a heavy tail for the distribution ofeither the silence period, the activity period, or both In the rest of this section, we
®rst specify the LRD behavior of the rate process associated with heavy-taileddistributions for on=off durations, then provide the estimates for bounds q x and
Q x in such a case We conclude this section by providing a weak convergencetheorem for the limiting input process fOtg obtained in Section 5.3, which, oncerescaled in space and time, converges toward the so-called fractional Brownianmotion
Trang 125.5.1 LRD Properties
Recall [6] that a stationary process fltg is said to exhibit short- (resp long-) rangedependence if its correlation function r de®ned in Eq (5.6) is such that the integral
1
0 r t dt is convergent (resp divergent) If the distributions of on and off periods
A and B are Coxian, that is, their Laplace transforms a* and b* are rationalfunctions, then standard results for Laplace transform inversion applied to expres-sion (5.7) entail that the correlation function t 7 ! r t tends exponentially fast to 0
as t " 1, thus corresponding to short-term dependence for process fltg Now, thesituation appears totally different in the case when the distribution of either offduration A or on duration B is heavy tailed A distribution function F is here de®ned
for some y > 0 As a consequence of de®nition (5.28), the Laplace transform
f *: p > 0 7 !01e pt dF t of a heavy-tailed distribution F with ®nite mean m andpower r 2 1; 2 veri®es
f * p 1 mp h G 2 r
r 1 pr o pr 5:29for small positive p, where G is Euler's function (see Section 5.7.3) For 1 < r < 2,such an expression for the Laplace transform near 0 in fact characterizes the heavy-tailed behavior of the corresponding distribution F (in the case when r 2, Eq.(5.29) is identical to a classical Taylor expansion, corresponding to a regulardistribution having a ®nite variance) We can then show the following
Proposition 5.5.1 Assume that the Laplace transforms a* and b* of the off and onperiods have expansions
a* p 1 p
a arpr o pr;
b* p 1 pb bsps o ps; 5:30
Trang 13respectively, withpositive coef®cients ar and bs and where powers r; s 21; 2 aresuchthat r s 6 4 The covariance function of rate fltg then veri®es
is easy to express its variance D2 t de®ned in Eq (5.3) as
r0 being expressed as in Proposition 5.5.1