[14] that if for independent random variables Ïi (i = 1,2) we have P(Ïi > u) â¼ ci. Â¯ .... Probability in the Engineering and Informational Sc...

0 downloads 1 Views 221KB Size

Maria Vlasiou†

arXiv:0902.0485v2 [math.PR] 4 Jun 2009

May 31, 2018

Abstract We consider a queuing model with the workload evolving between consecutive i.i.d. exponen(i) tial timers {eq }i=1,2,... according to a spectrally positive L´evy process Y (t) which is reflected (i) at 0. When the exponential clock eq ends, the additional state-dependent service require(i) (1) (i) ment modifies the workload so that the latter is equal to Fi (Y (eq )) at epoch eq + · · · + eq for some random nonnegative i.i.d. functionals Fi . In particular, we focus on the case when Fi (y) = (Bi − y)+ , where {Bi }i=1,2,... are i.i.d. nonnegative random variables. We analyse the steady-state workload distribution for this model.

1

Introduction

In this paper we focus on a particular queuing system with additional state-dependent services. There has been considerable previous work on queues with state-dependent service and arrival processes; see for example the survey by Dshalalow [12] for several references. The model under consideration involves a reflected L´evy process connected to the evolution of the workload. Special cases of L´evy processes are the compound Poisson process, the Brownian motion, linear drift processes, and independent sums of the above. The literature on queueing systems driven by L´evy processes is rather limited; see e.g. Bekker et al. [3] for references. Specifically, in this paper we consider a storage/workload model in which the workload evolves according to a reflected at zero spectrally positive L´evy process Y (t). That is, let X(t) be a spectrally positive L´evy process (a L´evy process with only positive jumps) modelling the input minus the output of the process and define − inf s60 X(s) = 0 and X(0) = x > 0. Then we have that Y (t) = X(t) − inf s6t X(s) (where Y (0) = x for some initial workload x > 0). In (i) addition, at exponential times with intensity q, given by {eq }i=1,2,... , the workload is “reset” to a certain level, depending on the workload level before the exponential clock ends. Specifically, at (1) (i) epoch t = eq + · · · + eq the workload V (t) equals Fi (V (t−)) for some random nonnegative i.i.d. functionals Fi . The main goal of our paper is to derive the stationary distribution of the workload V (t) for the above-described queuing model. We first identify the stationary distribution of the workload at embedded exponential epochs and then extend this result to an arbitrary time by using renewal arguments. We also identify the tail behaviour of the steady-state workload. ∗

University of Wroclaw, pl. Grunwaldzki 2/4, 50-384 Wroclaw, Poland, E-mail: [email protected] Eurandom and Department of Mathematics and Computer Science; Eindhoven University of Technology; P.O. Box 513; 5600 MB Eindhoven; The Netherlands, E-mail: [email protected] †

1

This model unifies and extends several related models in various directions. First of all, if X is a compound Poisson process and if Fi is the identity function, then our model reduces to the workload process of the M/G/1 queue. Kella et al. [18] consider a model with workload removal, which fits into our model by taking Fi (x) = 0 and by letting the spectrally positive L´evy process X be a Brownian motion superposed with an independent compound Poisson component. The added generality allows one to analyse more elaborate mechanisms of workload control, where the exponential times can be seen as review times, during which the workload can be changed to a different level as desired. Allowing for general functions Fi opens up the possibility of optimising such controls, although we do not consider this problem here. Instead of considering the classical compound Poisson input process and a linear output process for the queuing model, one can consider the case in which the L´evy process is nondecreasing, i.e. a subordinator; see for example Bekker et al. [3] and Boxma et al. [7]. Apart from the wish to unify and extend clearing models, we were also challenged by introducing a continuous-time analogue of the alternating service model considered in Vlasiou et al. [28, 29, 30, D

31, 33] that gave rise to the Lindley-type recursion W = (B − A − W )+ . In particular, we focus on the case when Fi (y) = (Bi − y)+ , where {Bi }i=1,2,... are i.i.d. nonnegative random variables. Hence, at exponential epochs the controlling mechanism leaves only a portion of the workload depending on the size of the workload just prior to the exponential timer. In particular, if Fi (y) = (Bi − y)+ , then this mechanism keeps the workload below a generic random size B, decreasing it when it is relatively large at the exponential epoch and increasing it when it is much smaller than B. This can be viewed as a continuous-time analogue of the above mentioned Lindley-type recursion. In the context of workload control mentioned above, this example can be interpreted as a mechanism that reflects existing storage with respect to an upper bound B. Our results focus on qualitative and quantitative properties of the steady-state workload distribution. We first establish Harris recurrence for the Markov chain embedded at workload adjustment points, yielding the convergence of the workload processes to an invariant distribution. We derive an equation for the invariant distribution of the embedded chain, as well as the invariant distribution of the original process. We use this equation to obtain expressions for the invariant distribution for an example that generalises [3, 7, 18]. We also investigate the tail behaviour of the steady-state distribution under both light-tailed and heavy-tailed assumptions. All these groups of results have the common theme that we rely on recently obtained results in the fluctuation theory of spectrally positive L´evy processes. The paper is organised as follows. In Section 2 we introduce a few basic facts concerning spectrally positive L´evy processes. In Section 3 we consider the embedded workload process and derive a recursive equation for its stationary distribution. In Section 4 we determine the steadystate workload distribution. Later on, in Section 5 we present some special cases. Finally, in Section 6 we focus on the tail behaviour of the steady-state workload.

2

Preliminaries

Throughout this paper we exclude the case of X with monotone paths. Let the dual process of ˆ ˆ X(t) be given by X(t) = −X(t). The process {X(s), s 6 t} is a spectrally negative L´evy process and has the same law as the time-reversed process {X((t − s)−) − X(t), s 6 t}. Following standard ˆ ˆ = inf s6t X(s), and conventions, let X(t) = inf s6t X(s), X(t) = sups6t X(s) and similarly X(t) ˆ ˆ X(t) = sups6t X(s). One can readily see that the processes Y (t) = X(t) − X(t) (for Y (0) = 0) 2

and X(t) (where X(0) = 0) have the same distribution; see e.g. Kyprianou [20, Lemma 3.5, p. 74]. Moreover, D ˆ D ˆ −X(t) = X(t), X(t) = −X(t). ˆ ˆ are all non-positive, the moment generating function E[eθX(t) Since the jumps of X ] exists for ˆ θ X(t) tψ(θ) all θ > 0 and is given by E[e ]=e for some function ψ(θ) that is well defined at least on the positive half-axis where it is strictly convex with the property that limθ→∞ ψ(θ) = +∞. Moreover, ψ is strictly increasing on [Φ(0), ∞), where Φ(0) is the largest root of ψ(θ) = 0. We shall denote the right-inverse function of ψ by Φ : [0, ∞) → [Φ(0), ∞). ˆ (note that σ is also a Denote by σ the Gaussian coefficient and by ν the L´evy measure of X Gaussian coefficient of X and that Π(A) = ν(−A) is a jump measure of X). Throughout this paper we assume that the following (regularity) condition is satisfied:

σ>0

or

Z

0

xν(dx) = ∞

or

ν(dx) << dx,

(2.1)

−1

where << dx means absolutely continuity with respect to the Lebesgue measure. Moreover, we assume that Px (τ0− < ∞) = 1, (2.2) where τ0− = inf{t > 0 : X(t) 6 0}. Finally, Px denotes the probability measure P under the condition that X(0) = x, and Ex indicates the expectation with respect to Px .

2.1

Scale functions

For q > 0, there exists a function W (q) : [0, ∞) → [0, ∞), called the q-scale function, that is continuous and increasing with Laplace transform Z ∞ e−θy W (q) (y)dy = (ψ(θ) − q)−1 , θ > Φ(q). (2.3) 0

The domain of W (q) is extended to the entire real axis by setting W (q) (y) = 0 for y < 0. We mention here some properties of the function W (q) that have been obtained in the literature which we will need later on. On (0, ∞) the function y 7→ W (q) (y) is right- and left-differentiable and, as shown in [23], under the condition (2.1), it holds that y 7→ W (q) (y) is continuously differentiable for y > 0. Closely related to W (q) is the function Z (q) given by Z y W (q) (z)dz. Z (q) (y) = 1 + q 0

The name “q-scale function” for W (q) and Z (q) is justified as these functions are harmonic for the ˆ killed upon entering (−∞, 0). Here we give a few examples of scale functions. For a large process X number of examples of scale functions see e.g. Chaumont et al. [10], Hubalek and Kyprianou [17], Kyprianou and Rivero [22].

3

Example 1. If X(t) = σB(t) − µt is a Brownian motion with drift µ (a standard model for small service requirements) then W (q) (x) = where δ = σ −2

p

1 (−ω+δ)x [e − e−(ω+δ)x ], σ2 δ

µ2 + 2qσ 2 and ω = µ/σ 2 .

Example 2. Suppose N (t)

X(t) =

X

σi − pt,

i=1

where p is the speed of the server and {σi } are i.i.d. service times that are coming according to the Poisson process N (t) with intensity λ. We assume that all σi are exponentially distributed with mean 1/µ. Then ψ(θ) = pθ − λθ/(µ + θ) and the scale function of the dual W (q) is given by + − W (q) (x) = p−1 A+ eq (q)x − A− eq (q)x , where A± =

µ+q ± (q) q + (q)−q − (q)

with q + (q) = Φ(q) and q − (q) is the smallest root of ψ(θ) = q: ±

q (q) =

2.2

q + λ − µp ±

p

(q + λ − µp)2 + 4pqµ . 2p

Fluctuation identities

The functions W (q) and Z (q) play a key role in the fluctuation theory of reflected processes as shown by the following identity (see Bertoin [4, Theorem VII.4 on p. 191 and (3) on p. 192] or Kyprianou and Palmowski [21, Theorem 5]). Lemma 2.1. For α > 0, E e−αX(eq ) =

q(α − Φ (q)) , Φ (q) (ψ (α) − q)

which is equivalent to P (X(eq ) ∈ dx) =

q W (q) (dx) − qW (q) (x)dx, Φ (q)

x > 0.

Moreover, −X(eq ) follows an exponential distribution with parameter Φ(q). The scale function gives also the density r (q) (x, y) = R(q) (x, dy)/dy of the q-potential measure Z ∞ e−qt Px (X(t) ∈ dy, τ0− > t)dt R(q) (x, dy) := 0

of the process X killed on exiting [0, ∞) when initiated from x. See also Pistorius [26]. Lemma 2.2. Under (2.1), we have that Z h i (q) e−Φ(q)z W (q)′ (y − x + z) − Φ(q)W (q) (y − x + z) dz. r (x, y) = [(x−y)+ ,x]

4

Proof. We start by noting that for all x, y > 0 and q > 0, 1 R(q) (x, dy) = Px (X(eq ) ∈ dy, X(eq ) > 0). q From the Wiener-Hopf factorisation of the L´evy process we have that X(eq ) − X(eq ) is independent of X(eq ). This leads to 1 R(q) (x, dy) = P (X(eq ) ∈ dy − x, X(eq ) > −x) q 1 = P ((X(eq ) − X(eq )) + X(eq ) ∈ dy − x, −X(eq ) 6 x) q Z 1 = P (−X(eq ) ∈ dz)P (X(eq ) − X(eq ) ∈ dy − x + z). q [(x−y)+ ,x] In the above expression, we integrate over the position of −X(eq ) which is not less than 0 under Px (this leads to the condition that −X(eq ) 6 x under P = P0 ) and it is less than X(eq ) = y under Px (hence, −X(eq ) > x − y under P ). Note that we always have that −X(eq ) > 0 under P , and thus the above integral is equal to the integral over [0, x] when y > x. Recall, that by duality X(eq ) − X(eq ) is equal in distribution to X(eq ) which has been identified in Lemma 2.1. In addition, the law of −X(eq ) is exponentially distributed with parameter Φ(q). We may, therefore, rewrite the expression for R(q) (x, dy) as follows: Z h i e−Φ(q)z W (q) (dy − x + z) − Φ(q)W (q) (y − x + z)dy dz. (2.4) R(q) (x, dy) = [(x−y)+ ,x]

Under Condition (2.1), W (q) is differentiable and hence the last equality completes the proof. Remark. Lemma (2.2) and similar results can be proven without the assumption made in (2.1), but at the cost of more complex expressions. We would have to use (2.4) instead of the much nicer form for r (q) (x, y)dy.

3

Equilibrium distribution of the embedded process (1)

(n)

We consider the workload process at the embedded epochs eq + · · · + eq , just after the additional service arrives. Note that this process is a Markov chain {Zn , n ∈ N} with transition kernel: Z k(x, dy) = Px (F (Y (eq )) ∈ dy) = Px (f (Y (eq )) ∈ dy)dP F (f ), (3.1) where P F is the law of F . Lemma 3.1. We have that Px (Y (eq ) ∈ dy) = h(x, y)dy + e−Φ(q)x W (q) (0)δ0 (dy), where q (q) −Φ(q)x (q)′ (q) h(x, y) = qr (x, y) + e W (y) − qW (y) , Φ (q) and where the first increment qr (q) (x, y) is given in Lemma 2.2. 5

(3.2)

Proof. Define κ0 = inf{t > 0 : Y (t) = 0}, and observe that Px (Y (eq ) ∈ dy) = Px (Y (eq ) ∈ dy, κ0 > eq ) + Px (Y (eq ) ∈ dy, κ0 < eq ) = Px (X(eq ) ∈ dy, τ0− > eq ) + P (Y (eq ) ∈ dy)Px (τ0− < eq ) = qr (q) (x, y)dy + P (X(eq ) ∈ dy)P (−X(eq ) > x) q W (q)′ (y) − qW (q) (y) 1{y>0} dy = qr (q) (x, y)dy + e−Φ(q)x Φ (q) + e−Φ(q)x W (q) (0)δ0 (dy), where in the second equality we use the lack of memory of the exponential distribution and the fact that X is spectrally positive; hence it crosses 0 in continuous way. The last equality follows from Lemma 2.1. Lemma 3.2. Assume that there exists an a.s. finite r.v. F0 such that F (y) 6 F0

for any y.

(3.3)

Then the stationary distribution π(y) of Zn exists and satisfies the following balance equation: Z Z Z ∞ g(y)k(x, dy)dπ(x) (3.4) g(y)dπ(y) + g(0)π(0) = [0,∞)

0

[0,∞)

for any bounded function g. Proof. We show that {Zn , n ∈ N} is Harris ergodic, see for example Asmussen [2, Theorems VII.3.3 and VII.3.5, p. 200-201]. Fix N > 0 such that P (F0 6 N ) > 0 and define τN = inf{n > D

1 : Zn 6 N }. It is easy to construct i.i.d. random variables {F0,n , n ∈ N} such that F0,1 = F0 and Zn 6 F0,n , n ∈ N. Observe that P (τN > k | Z0 = x) = P (Z1 > N, . . . , Zk > N | Z0 = x) 6 P (F0,1 > N, . . . , F0,k > N ) = P (F0 > N )k , which implies that sup E[τN | Z0 = x] < ∞.

(3.5)

x>0

This implies Harris ergodicity, once we find a constant p > 0 and a probability measure Q(·) such that P (Z1 ∈ B | Z0 = x) > pQ(B), x ∈ [0, N ]. (3.6) Let x ∈ [0, N ]. We construct p and Q(·) as follows. Recall that κ0 = inf{t > 0 : Y (t) = 0}, observe that P (Z1 ∈ B | Z0 = x) = Px (F (Y (eq )) ∈ B) > Px (F (Y (eq )) ∈ B, κ0 < eq ) = P (F (Y (eq )) ∈ B)Px (κ0 < eq ) > P (F (Y (eq )) ∈ B)PN (κ0 < eq ) := Q(B)p. Since the paths of Y (·) are non-monotone, we have that p > 0, implying (3.6).

6

Remark. The assumption (3.3) is satisfied when F (y) = (B − y)+ with F0 = B. Moreover, if the functional is given by F (y) = (B − y)+ and the r.v. B has a density then we have that Z Z ∞Z ∞ q (q)′ (q) (q) −Φ(q)x W (y) − qW (y) dy dFB (t)dπ(x), π(0) = qr (x, y)dy + e Φ (q) [0,∞) 0 t (3.7) and for any bounded function g, Z

∞ 0

g(y)dπ(y) = Z Z ∞Z t q (q)′ (q) (q) −Φ(q)x W (y) − qW (y) dFB (t)dπ(x) dyg(t − y) qr (x, y) + e Φ (q) [0,∞) 0 0 Z ∞ Z g(t)dFB (t), e−Φ(q)x dπ(x) + W (q) (0) 0

[0,∞)

where FB is the distribution function of the generic r.v. B. In Section 5 we analyse more specific examples.

4

Steady-state workload distribution

Theorem 4.1. Suppose that the stationary distribution π exists. Then the stationary distribution V (∞) also exists. Moreover, for a bounded function g, Eg(V (∞)) =

Z

[0,∞)

π(dx)

Z

∞ 0

q (q)′ (q) (q) −Φ(q)x W (y) − qW (y) g(y)dy qr (x, y) + e Φ (q) Z ∞ (q) e−Φ(q)x π(dx), + g(0)W (0) 0

where the distribution π satisfies (3.4) with k defined via (3.1) and Lemma 3.1 and where r (q) (x, y) is given in Lemma 2.2. Proof. The first part of the theorem follows from Asmussen [2, Theorem VII.6.4, p. 216]. Using the Palm inversion formula (see Asmussen [2, Theorem VII.6.4, p. 216]) one can identify the steadystate workload distribution V (∞) by the following identity: Z eq Z g(V (s))ds. (4.1) π(dx)Ex Eg(V (∞)) = q 0

[0,∞)

7

The RHS can be further developed as follows: Z eq Z Z eq Z Ex [g(Y (s))]ds π(dx)E g(V (s))ds = q π(dx)Ex q 0 [0,∞) 0 [0,∞) Z ∞ Z π(dx) e−qt Ex [g(Y (t))]dt =q [0,∞) 0 Z π(dx)Ex [g(Y (eq ))] = [0,∞) Z ∞ Z q (q) −Φ(q)x (q)′ (q) π(dx) g(y)dy qr (x, y) + e = W (y) − qW (y) Φ (q) [0,∞) 0 Z ∞ (q) e−Φ(q)x π(dx). + g(0)W (0) 0

5

Computational examples

We now turn to analysing a few specific examples. We find that there are several solution strategies. One can either solve the equations given in Sections 3 and 4 directly, or one can also take a less direct route, using Laplace transforms. We shall consider examples of both strategies. To this end, we start with the following simple, but very useful observation. Using PASTA, V has the same distribution as U which is the equilibrium distribution of the Markov chain {Un , n ∈ N} (1) (n) of the workload process embedded at times (eq + · · · + eq )− (i.e. right before the “correction”). To obtain our main result, we first state and prove the following useful lemma. Lemma 5.1. The following equality holds in distribution: D

U = max{F (U ) + X(eq ), X(eq )}.

(5.1)

D

Proof. If U0 is x, we see that U1 = Y (eq ), with Y (0) = F (x). If Y (0) = F (x), we further have D

Y (t) = max{F (x) + X(t), X(t)}, which follows, for example, by mimicking the proof of Kyprianou [20, Lemma 3.5, p. 74], starting from the expression for Y (t) given in Kyprianou [20, p. 19]. Combining these two observations leads to the statement of the lemma. Example 3. The most trivial example is when F (y) = B > 0. In this simple case, there is no need to use the formula derived for the generator k(x, y). Using the above lemma, we see that D

V (∞) = max{B + X(eq ), X(eq )} = X(eq ) + max{B + X(eq ) − X(eq ), 0} D

= X(eq ) + max{B − eΦ(q) , 0}.

8

In the last equation, which follows from the Wiener-Hopf factorisation, eΦ(q) is a random variable which is exponentially distributed with rate Φ(q), which is independent of everything else. Observe that E[e−s max{B−eΦ(q) ,0} ] = P (eΦ(q) > B) + E[e−s(B−eΦ(q) ) ; eΦ(q) < B] = P (eΦ(q) > B) + E[e−s(B−eΦ(q) ) ] − E[e−s(B−eΦ(q) ) ; eΦ(q) > B] = E[e−Φ(q)B ] + E[e−sB ] =

Φ(q) Φ(q) − E[e−Φ(q)B ] Φ(q) − s Φ(q) − s

Φ(q)E[e−sB ] − sE[e−Φ(q)B ] Φ(q) − s

Combining this with Lemma 2.1, we obtain E[e−sV (∞) ] =

q(s − Φ (q)) Φ(q)E[e−sB ] − sE[e−Φ(q)B ] . Φ (q) (ψ (s) − q) Φ(q) − s

(5.2)

This is an extension of various results in the literature focusing on clearing models (i.e. systems with workload removal) where B = 0. See for example [8, 18] and references therein. Example 4. We now consider an example where it seems more natural to solve the equations developed in Sections 3 and 4 directly. Consider the case when F (y) = (B − y)+ with B being PN (t) exponentially distributed with intensity β. Moreover, X(t) = i=1 σi − pt is a compound Poisson process with exponentially distributed service times σi with intensity µ (see also the setup of Example 2). Note that Z ∞ θ (1 − e−θz )µe−µz dz = pθ − λ ψ(θ) = pθ − λ µ(µ + θ) 0 and recall that Φ(q) = q + (q). Thus, Z ∞ Z q˜ π (Φ(q))(α − Φ(q)) 1 −αV (∞) dye−αy r (q) (x, y) + π(dx) + (A+ − A− )˜ π (Φ(q)) Ee =q Φ(q)(ψ(α) − q) p 0 [0,∞) = H(α, π) +

q˜ π (Φ(q))(α − Φ(q)) 1 + (A+ − A− )˜ π (Φ(q)), Φ(q)(ψ(α) − q) p

where q − 2q + (q) q + (q) − q − (q) H(θ, u) = A − u ˜ (θ) u ˜(q + (q)) p (θ − q + (q))(θ − q − (q)) θ 2 − q + (q)2 2q − (q) +˜ u(θ + q (q) − q (q)) 2 θ − q − (q)2 +

−

R and u ˜(θ) = [0,∞) e−θx u(dx). To complete the computations we have to find the LST π ˜ of the stationary distribution π. By the memoryless property of the exponential distribution of B we have that π(dx) = βe−βx dx, x > 0. Hence, π ˜ (θ) = π(0) + 9

β . β+θ

We will find now π(0) using (3.7). Z ∞ Z ∞ q −βt (q)′ (q) e dt π(0) = π(0)β W (y) − qW (y) dy+ Φ(q) t 0 Z ∞ Z ∞ Z ∞ q (q)′ (q) 2 −βt (q) −Φ(q)x −βx W (y) − qW (y) dy. +β e dt e dx qr (x, y) + e Φ(q) t 0 0 Let now ǫβ (dx) = βe−βx dx and G(q) =

βq q − (q) − q + (q) . p(β − q − (q)) q − (q)q + (q)

Then, π(0) =

G(q) β+qβ+ (q) + H(0, ǫβ ) − H(β, ǫβ ) 1 − G(q)

.

More general cases can be handled at the cost of more cumbersome computations. For example, we can add a compound Poisson process with phase-type jumps to the L´evy process, and we can allow B to have a phase-type distribution. See [9] for similar computations in a discrete-time setting. If one cannot expect to obtain distributions in closed form, one can still aim to obtain Laplace transforms. Using similar arguments as in Example 3, we obtain the key equation (abbreviating V = V (∞)) q(s − Φ (q)) Φ(q)E[e−sF (V ) ] − sE[e−Φ(q)F (V ) ] . (5.3) E[e−sV ] = Φ (q) (ψ (s) − q) Φ(q) − s This equation is, of course, too complicated to solve for an arbitrary F , but nevertheless seems useful. Example 5. Suppose that F (x) = δx, δ ∈ (0, 1). This case is a generalisation of a model for the throughput behaviour of a data connection under the Transmission Control Protocol (TCP) where typically the L´evy process is a simple deterministic drift; see for example [1, 16, 24, 25] and references therein. Equation (5.3) reduces to E[e−sV ] =

q qs E[e−sδV ] + E[e−Φ(q)δV ]. q − ψ(s) Φ(q)(ψ (s) − q)

(5.4)

This is an equation of the form v(s) = g(s)v(δs) + h(s), which, since v(0) = 1, has as (formal) solution ∞ k−1 ∞ X Y Y g(δj s). g(δj s) + h(δk s) v(s) = j=0

j=0

k=0

Specialising to our situation we obtain v(s) =

=

∞ Y

j=0

∞ k−1 X Y qsδk q q + v(δΦ(q)) q − ψ(δj s) Φ(q)(ψ (sδk ) − q) q − ψ(δj s)

∞ Y

∞ X

j=0

j=0

k=0

q s + v(δΦ(q)) q − ψ(δj s) Φ(q) 10

k=0

δk

k Y

j=0

q . q − ψ(δj s)

Since ψ(0) = 0, it easily follows that the infinite products converge, and the final expression for v(s) yields an equation from which the only remaining unknown constant v(δΦ(q)) can be solved explicitly.

6

Tail behaviour

In this section we consider the tail behaviour of V = V (∞), under a variety of assumptions on the tail behaviour of the the L´evy measure ν. The treatment in this section can be seen as the continuous-time analogue of the results in Vlasiou and Palmowski [32]. There, a similar result is shown where eq is geometrically distributed, X(·) is replaced by a (general) random walk, and F (y) = (B − y)+ , with B identical to the increments of the random walk. In [32] we modify ideas from Goldie [15] in the light-tailed case and develop stochastic lower and upper bounds in the heavy-tailed case. Here we take a different approach which is based on the well-developed fluctuation theory of spectrally one-sided L´evy processes. Before we present our main results, we first state some lemmas. Lemma 6.1. The following (in)equalities hold: P (U > x) = P (X(eq ) + F (U ) > x) Z ∞ (P (X(eq ) > x) − P (X(eq ) > x + y))P (−X(eq ) − F (U ) ∈ dy), +

(6.1)

0

P (U > x) 6 P (X(eq ) + F (U ) > x) + P (X(eq ) > x)P (−X(eq ) > F (U )),

(6.2)

P (U > x) > P (X(eq ) > x)P (−X(eq ) > F (U )).

(6.3)

Proof. All identities follow from Lemma 5.1, the decomposition X(eq ) = X(eq ) − (X(eq ) − X(eq )), and the Wiener-Hopf factorisation factorisation which implies that X(eq ) and X(eq ) − X(eq ) are independent. We also use the simple fact that X(eq ) − X(eq ) has the same law as −X(eq ) (see Kyprianou [20, p. 158]). In addition, we need two standard results from the literature on L´evy processes. Lemma 6.2. (Kyprianou [20, p. 165]) The random variable X(eq ) has the same law as H(eκ(q,0) ), where {(L−1 (t), H(t)), t > 0} is a ladder height process of X with the Laplace exponent κ(̺, ζ) defined by −1 Ee̺L (t)+ζH(t) = eκ(̺,ζ)t . From the above, one can easily derive the following version of the Pollaczek-Khinchine formula. Lemma 6.3. (Bertoin [4, p. 172]) The following identity holds: P (X(eq ) > x) = κ(q, 0)U (q) (x, ∞), where U

(q)

(dx) =

Z

0

∞Z ∞

e−qs P (H(t) ∈ dx, L−1 (t) ∈ ds)dt

0

is the renewal function of the ladder height process {(L−1 (t), H(t)), t < L(eq )} and L(·) is a local time of X. 11

We now turn to the tail behaviour of U . Let Π(A) = ν(−A) be the L´evy measure of the spectrally positive L´evy process X (with support on R+ ). First we investigate the case where the L´evy measure is a member of the so-called convolution equivalent class S (α) . To define this class, take α > 0. We shall say that measure Π is convolution equivalent (Π ∈ S (α) ) if for fixed y we have that ¯ − y) Π(u = eαy , ¯ u→∞ Π(u) ¯ − 1) Π(n lim = eα , ¯ n→∞ Π(n)

if Π is nonlattice,

lim

if Π is lattice with span 1,

and

Z ∞ ¯ ∗2 (u) Π eαy Π(dy), lim ¯ =2 u→∞ Π(u) 0 ¯ where ∗ denotes convolution and Π(u) = Π((u, ∞)). When α = 0, then we are in the subclass of subexponential measures and there is no need to distinguish between the lattice and non-lattice cases (see [6]). We start from the following auxiliary result, which is the continuous-time analogue of Lemma 2 in [32]. Lemma 6.4. Assume that Π ∈ S (α) and ψ(α) < q for ψ(α) = log EeαX(1) . Then q ¯ Π(x), (q − ψ(α))2 Φ(q) + α ¯ q Π(x), P (X(eq ) > x) ∼ 2 (q − ψ(α)) Φ(q) P (X(eq ) > x) ∼

(6.4) (6.5)

where f (x) ∼ g(x) means that limx→∞ f (x)/g(x) = 1. Remark. Note that for α = 0 1¯ P (X(eq ) > x) ∼ P (X(eq ) > x) ∼ Π(x). q ¯ X(t) (x) for t fixed as x → ∞, where ΠX(t) Proof. It is well known that P (X(t) > x) ∼ EeαX(t) Π is a L´evy measure of X(t) (see Embrechts et al. [14]). Since X(t) is infinitely divisible we have ¯ ΠX(t) (·) = tΠ(·) and hence P (X(t) > x) ∼ t(EeαX(1) )t Π(x). Since X(eq ) 6 X(eq ) by (6.5) and the dominated convergence theorem we obtain (6.4). We will use similar arguments as in the proof of Lemma 3.5 of Kl¨ uppelberg et al. [19]. For ΠH ∈ S (α) note that ¯ H (u), P (H(t) > u) ∼ t(EeαH(1) )t Π where ΠH is the L´evy measure of the process {H(t), t < eκ(q,0) } (see Embrechts et al. [14]). Using uniform in u Kesten bounds [19]: ¯ H (u) P (H(t) > u) 6 P (H([t] + 1) > u) 6 K(ǫ)(EeαH(1) + ǫ)[t]+1 Π for any ǫ > 0 and some constant K(ǫ), and the dominated convergence theorem, we derive by Lemma 6.2, κ(q, 0) P (X(eq ) > u) = lim . (6.6) ¯ u→∞ ΠH (u) (κ(q, 0) − log EeαH(1) )2 12

The Wiener-Hopf factorisation yields that ˆ

EeαX(eq ) = EeαH(eκ(q,0) ) EeαH(eκˆ(q,0) ) , ˆ −1 (t), H(t)) ˆ where (L is a downward ladder height process with Laplace exponent κ ˆ (̺, ζ). Since X ˆ is spectrally positive, we can choose the process H(t) = −t and hence Z ∞ κ ˆ (q, 0) ˆ κˆ (q,0) ) αH(e , e−ˆκ(q,0)t e−αt dt = Ee =κ ˆ(q, 0) κ ˆ (q, α) 0 where κ ˆ (q, α) = Φ(q) + α. Thus q κ ˆ (q, α) κ(q, 0) . = q − ψ(α) κ ˆ (q, 0) κ(q, 0) − log EeαH(1) Using the well known fact that q = κ(q, 0)ˆ κ(q, 0) (see Kyprianou [20, p. 166]) we identify the right-hand side of (6.6) as q (Φ(q) + α)2 P (X(eq ) > u) = . ¯ H (u) u→∞ (q − ψ(α))2 Φ(q) Π lim

Now using similar arguments like in Vigon [27] (see also Kyprianou [20, Th. 7.7 on p. 191] and Kyprianou [20, Th. 7.8 on p. 195]) we derive Z ∞ ¯ ¯ + y)Vˆ (dy), ΠH (u) = Π(u 0

ˆ −1 (t), H(t)), ˆ where Vˆ (y) is the renewal function of the downward ladder height process {(L t < −1 −1 ˆ ˆ ˆ κ ˆ (q, 0)} = {(L (t), H(t)), L (t) < eq }. Thus ¯ H (u) Z ∞ Π e−αy Vˆ (dy) = lim ¯ u→∞ Π(u) Z0 ∞ ˆ −1 ˆ Ee−qL (t)−αH(t) dt = Z0 ∞ 1 1 e−ˆκ(q,α)t dt = = = . κ ˆ (q, α) Φ(q) + α 0 Hence, by [13] also ΠH ∈ S (α) if and only if Π ∈ S (α) . This completes the proof. It is known [14] that if for independent random variables χi (i = 1, 2) we have P (χi > u) ∼ ¯ ¯ ci G(u) as u → ∞ and G ∈ S (α) , then P (χ1 + χ2 > u) ∼ (c1 Eeαχ2 + c2 Eeαχ1 )G(u). This observation and (6.1) in Lemma 6.1 and Lemma 6.4 yield the following main result. Theorem 6.1. Assume that Π ∈ S (α) and ψ(α) < q. Moreover, let F (y) 6 F0 (> 0) for any y, and ¯ assume that there exists a constant c > 0 such that P (F (y) > x) ∼ P (F0 > x) ∼ cΠ(x) as x → ∞ ¯ for each y (If c = 0 then P (F (y) > x) = o(Π(x))). Then q P (U > x) ∼ cEeαX(eq ) + EeαF (U ) (q − ψ(α))2 i Φ(q) + α h q −α(−X (eq )−F (U )) ¯ ; −X(eq ) − F (U ) > 0 Π(x) E 1−e + (q − ψ(α))2 Φ(q) as x → ∞. 13

The conditions in this theorem are satisfied by both examples F (y) = 0 (in which case we take F0 = 0, c = 0) and F (y) = (B − y)+ (in which case F0 = B). If Π is subexponential (Π ∈ S (0) ), then 1 ¯ Π(x). P (U > x) ∼ c + q We will consider now the Cram´er case (light-tailed case). Assume that there exists Φ(q) such that ψ(Φ(q)) = q (6.7) and that

∂κ(q, β) < ∞. m(q) := ∂β β=−Φ(q)

(6.8)

Note that if Π ∈ S(α) and ψ(α) < q, then condition (6.7) is not satisfied. Moreover, we assume that EeΦ(q)F (U ) < ∞. (6.9) Theorem 6.2. Assume that (6.7)-(6.9) hold and that the support of Π is non-lattice. Then P (U > x) ∼ Ce−Φ(q)x as x → ∞, where

C = P (−X(eq ) > F (U ))κ(q, 0) (Φ(q)m(q))−1 .

Proof. We introduce the new probability measure dP θ = eθX(t)−ψ(θ)t , dP Ft

where Ft is a natural filtration of X. On P θ , the process X is again a spectrally positive L´evy (q) process with the L´evy measure Πθ (dx) = eθx Π(dx), which is also nonlattice. Let Uθ be the renewal function appearing in Lemma 6.3 with P replaced by P θ . Recall that L−1 (t) is a stopping time. Hence, from the optional stopping theorem, we have that Z ∞Z ∞ −Φ(q)x (q) e−Φ(q)x P Φ(q) (H(t) ∈ dx, L−1 (t) ∈ ds)dt e UΦ(q) (dx) = 0 0 Z ∞Z ∞ e−Φ(q)x e−qs+Φ(q)x P (H(t) ∈ dx, L−1 (t) ∈ ds)dt = U (q) (dx). = 0

0

We follow now Bertoin and Doney [5] (see also Kyprianou [20, Th. 7.6 on p. 185]). From Lemma 6.3 we have Z ∞ Z ∞ (q) (q) eΦ(q)x P (X(eq ) > x) = κ(q, 0) e−Φ(q)z UΦ(q) (x + dy). e−Φ(q)(y−x) UΦ(q) (dy) = κ(q, 0) 0

x

(q)

From Kyprianou [20, Th. 5.4 on p. 114] it follows that UΦ(q) (dy) has a nonlattice support. From the key renewal theorem (see Kyprianou [20, Cor. 5.3 on p. 114]) the measure UΦ(q) (x + dy) converges weakly to the Lebesgue measure E Φ(q)1H(1) dy (see Kyprianou [20, Th. 7.6 on p. 185]). Thus lim eΦ(q)x P (X(eq ) > x) =

x→∞

14

κ(q, 0) . Φ(q)E Φ(q) H(1)

Observe that E

Z

∞

Z

∞

Z

∞

xU (1) (dx) e E H(t)dt = te E H(1)dt = H(1) = 0 0 0 Z ∞ Z ∞ Z ∞ Z ∞ −t Φ(q) −t e xP (H(t) ∈ dx) = xeΦ(q)x−qs P (H(t) ∈ dx, L−1 (t) ∈ ds)dt e dt = 0 0 0 0 Z ∞ Z ∞ ∂κ(q, β) −t Φ(q)H(t)−qL−1 (t) −t−κ(q,−Φ(q))t . = e EH(t)e dt = te dt ∂β β=−Φ(q) 0 0

Φ(q)

−t

Φ(q)

−t

Φ(q)

From the Wiener-Hopf factorisation (see Kyprianou [20, p. 167]) it follows that q − ψ(θ) = κ(q, −θ)ˆ κ(q, θ).

From the convexity of the Laplace exponents φ and ψ we have that κ ˆ (q, Φ(q)) = 2Φ(q) > 0 and hence κ(q, −Φ(q)) = 0. Finally, ∂κ(q, β) Φ(q) . E H(1) = ∂β β=−Φ(q) Note that by (6.7) and (6.9), P (X(eq ) > x) = o(e−Φ(q)x ) and P (X(eq ) + F (U ) > x) = o(e−Φ(q)x ). Inequalities (6.2) and (6.3) in Lemma 6.1 complete the proof.

Acknowledgments We thank Bert Zwart for his helpful advice and useful comments. This work is partially supported by the Ministry of Science and Higher Education of Poland under the grant N N2014079 33 (20072009).

References ´n ˜ ez-Queija, R. (2002). State[1] Altman, E., Avrachenkov, K., Barakat, C. and Nu dependent M/G/1 type queueing analysis for congestion control in data networks. Computer Networks 39, 789–808. [2] Asmussen, S. (2003). Applied Probability and Queues. Springer-Verlag, New York. [3] Bekker, R., Boxma, O.J. and Kella, O. (2008). Queues with delays in two-stage strategies and L´evy input. Journal of Applied Probability 45, 314–332. [4] Bertoin, J. (1996). L´evy processes. No. 121 in Cambridge tracts in mathematics. Cambridge University Press. [5] Bertoin, J. and Doney, R.A. (1994). Cram´ers estimate for L´evy processes. Statistics and Probability Letters 21, 363–365. [6] Bertoin, J. and Doney, R.A. (1996). Some asymptotic results for transient random walks. Advances in Applied Probability 28, 207–226. 15

[7] Boxma, O.J., Mandjes, M. and Kella, O. (2008). On a queuing model with service interruptions. Probability in the Engineering and Informational Sciences 22, 537–555. [8] Boxma, O.J., Perry, D. and Stadje, W. (2001). Clearing models for M/G/1 queues. Queueing Systems 38, 287–306. [9] Boxma, O.J. and Vlasiou, M. (2007). On queues with service and interarrival times depending on waiting times. Queueing Systems 56, 121–132. [10] Chaumonth, L., Kyprianou, A.E. and Pardo, J.C. (2008). Some explicit identities associated with positive self-similar Markov processes. Stochastic Processes and Their Applications. Available online 7 May 2008. [11] Cline, D.B.H. (1986). Convolution tails, product tails and domains of attraction. Probability Theory and Related Fields 72, 529–557. [12] Dshalalow, J.H. (1997). Queueing systems with state dependent parameters. Frontiers in Queueing: Models and Applications in Science and Engineering, 61–116. [13] Embrechts, P. and Goldie, C.M. (1982). On convolution tails. Stochastic Processes and their Applications 13, 263–278. [14] Embrechts, P., Goldie, C.M. and Veraverbeke, N. (1979). Subexponentiality and infinite divisibility. Zeitschrift f¨ ur Wahrscheinlichkeitstheorie und verwandte Gebiete 49, 335– 347. [15] Goldie, C. (1991). Implicit renewal theory and tails of solutions of random equations. The Annals of Applied Probability 1, 126–166. [16] Guillemin, F., Robert, P. and Zwart, B. (2004) AIMD Algorithms and exponential functionals. The Annals of Applied Probability 14, 90–117. [17] Hubalek, F. and Kyprianou, A.E. (2008). Old and new examples of scale functions for spectrally negative L´evy processes. Mathematics ArXiv 0801.0393v2. [18] Kella, O., Perry, D. and Stadje, W. (2003). A stochastic clearing model with a Brownian and a compound Poisson component. Probability in the Engineering and Informational Sciences 17, 1–22. ¨ ppelberg, C., Kyprianou, A.E. and Maller, R.A. (2004). Ruin probabilities and [19] Klu overshoots for general L´evy insurance risk processes. The Annals of Applied Probability 14, 1766–1801. [20] Kyprianou, A.E. (2006). Introductory lectures on fluctuations of L´evy processes with applications. Universitext. Springer-Verlag, Berlin. [21] Kyprianou, A.E. and Palmowski, Z. (2005). A martingale review of some fluctuation theory for spectrally negative L´evy processes. In S´eminaire de Probabilit´es XXXVIII. vol. 1857 of Lecture Notes in Math. Springer, Berlin pp. 16–29.

16

[22] Kyprianou, A.E. and Rivero, V. (2008). Special, conjugate and complete scale functions for spectrally negative L´evy processes. The Electronic Journal of Probability 13, 1672–1701. [23] Lambert, A. (2000). Completely asymmetric L´evy processes confined in a finite interval. Annales de l’Institut Henri Poincar´e. Probabilit´es et Statistiques 36, 251–274. [24] Maulik, K. and Zwart, B. (2006). Tail asymptotics for exponential functionals of L´evy processes. Stochastic Processes and their Applications 116, 156–177. [25] Maulik, K. and Zwart, B. (2009). An extension of the square root law of TCP. Annals of Operations Research. To appear. [26] Pistorius, M. (2003). Exit problems of L´evy processes with applications in finance. Ph.D. thesis, Utrecht University, The Netherlands. [27] Vigon, V. (2002). Votre L´evy rampe-t-il? Journal of the London Mathematical Society 65, 243–256. [28] Vlasiou, M. (2007). A non-increasing Lindley-type equation. Queueing Systems 56, 41–52. [29] Vlasiou, M. and Adan, I.J.B.F. (2005). An alternating service problem. Probability in the Engineering and Informational Sciences 19, 409–426. [30] Vlasiou, M. and Adan, I.J.B.F. (2007). Exact solution to a Lindley-type equation on a bounded support. Operations Research Letters 35, 105–113. [31] Vlasiou, M., Adan, I.J.B.F. and Wessels, J. (2004). A Lindley-type equation arising from a carousel problem. Journal of Applied Probability 41, 1171–1181. [32] Vlasiou, M. and Palmowski, Z. (2008). Large deviations for a random sign Lindley recursion. Available at http://arxiv.org/abs/0808.3495. [33] Vlasiou, M. and Zwart, B. (2007). Time-dependent behaviour of an alternating service queue. Stochastic Models 23, 235–263.

17