Abstract This paper considers the tail asymptotics for a cumulative process {B(t); t ≥ 0} sampled at a heavy-tailed random time T. The main contribution of this paper is to establish several sufficient conditions for the asymptotic equality P(B(T)> bx) ∼ P(M(T)> bx) ∼ P(T> x) as x → ∞, where M(t) = sup0≤u≤tB(u) and b is a certain positive constant. The main results of this paper can be used to obtain the subexponential asymptotics for various queueing models in Markovian environments. As an example, using the main results, we derive subexponential asymptotic formulas for the loss probability of a single-server finite-buffer queue with an on/off arrival process in a Markovian environment
This thesis consists of five papers (A-E). In Paper A, we study transient properties of the queue le...
This paper considers the so-called M/G/∞ model: jobs arrive according to a Poisson process with rate...
Consider the single-server queue in which customers are rejected if their total sojourn time would e...
AbstractWe study the tail asymptotics of the r.v. X(T) where {X(t)} is a stochastic process with a l...
Abstract. In this paper, we consider a discrete time queueing sys-tem fed by a superposition of an O...
Consider a discrete time queue with i.i.d. arrivals (see the generalisation below) and a single serv...
Consider a uid queue with a nite buer B and capacity c fed by a superposition of N independent On-O...
With (Qt)t denoting the stationary workload process in a queue fed by a Lévy input process (Xt)t, th...
This paper analyzes large deviation probabilities related to the number of customers in a Markov-mod...
In this paper, we derive the bounds formulas for the asymptotic tail distribution in a queue whose a...
We consider asymptotic behaviors of the stationary tail probabilities in the dis-crete time GI=G=1 t...
Consider a buffer whose input is a superposition of L independent identical sources, and which is se...
AbstractWe consider the reflection of an additive process with negative drift controlled by a Markov...
htmlabstractConsider the single-server queue in which customers are rejected if their total sojourn ...
\u3cp\u3eWe consider the Δ(i)/G/1 queue, in which a total of n customers join a single-server queue ...
This thesis consists of five papers (A-E). In Paper A, we study transient properties of the queue le...
This paper considers the so-called M/G/∞ model: jobs arrive according to a Poisson process with rate...
Consider the single-server queue in which customers are rejected if their total sojourn time would e...
AbstractWe study the tail asymptotics of the r.v. X(T) where {X(t)} is a stochastic process with a l...
Abstract. In this paper, we consider a discrete time queueing sys-tem fed by a superposition of an O...
Consider a discrete time queue with i.i.d. arrivals (see the generalisation below) and a single serv...
Consider a uid queue with a nite buer B and capacity c fed by a superposition of N independent On-O...
With (Qt)t denoting the stationary workload process in a queue fed by a Lévy input process (Xt)t, th...
This paper analyzes large deviation probabilities related to the number of customers in a Markov-mod...
In this paper, we derive the bounds formulas for the asymptotic tail distribution in a queue whose a...
We consider asymptotic behaviors of the stationary tail probabilities in the dis-crete time GI=G=1 t...
Consider a buffer whose input is a superposition of L independent identical sources, and which is se...
AbstractWe consider the reflection of an additive process with negative drift controlled by a Markov...
htmlabstractConsider the single-server queue in which customers are rejected if their total sojourn ...
\u3cp\u3eWe consider the Δ(i)/G/1 queue, in which a total of n customers join a single-server queue ...
This thesis consists of five papers (A-E). In Paper A, we study transient properties of the queue le...
This paper considers the so-called M/G/∞ model: jobs arrive according to a Poisson process with rate...
Consider the single-server queue in which customers are rejected if their total sojourn time would e...