Related papers: Buffer-overflows: joint limit laws of undershoots …
We consider a sequence of single-server queueing models operating under a service policy that incorporates batches into processor sharing: arriving jobs build up behind a gate while waiting to begin service, while jobs in front of the gate…
We consider the spectrally negative Levy processes and determine the joint laws for the quantities such as the first and last passage times over a fixed level, the overshoots and undershoots at first passage, the minimum, the maximum and…
In this paper we study supercritical super-OU processes with general branching mechanisms satisfying a second moment condition. We establish central limit theorems for the super-OU processes. In the small and crtical branching rate cases,…
We consider the heavy-traffic approximation to the $GI/M/s$ queueing system in the Halfin-Whitt regime, where both the number of servers $s$ and the arrival rate $\lambda$ grow large (taking the service rate as unity), with…
This paper is concerned with the behaviour of a L\'{e}vy process when it crosses over a positive level, $u$, starting from 0, both as $u$ becomes large and as $u$ becomes small. Our main focus is on the time, $\tau_u$, it takes the process…
In this paper we analyse the phenomenon of the slow passage through a transcritical bifurcation with special emphasis in the maximal delay $z_d(\lambda,\varepsilon)$ as a function of the bifurcation parameter $\lambda$ and the singular…
We characterize the small-time asymptotic behavior of the exit probability of a L\'evy process out of a two-sided interval and of the law of its overshoot, conditionally on the terminal value of the process. The asymptotic expansions are…
Packet traffic in complex networks undergoes the jamming transition from free-flow to congested state as the number of packets in the system increases. Here we study such jamming transition when queues are operated by the priority queuing…
In languages like C, buffer overflows are widespread. A common mitigation technique is to use tools that detect them during execution and abort the program to prevent the leakage of data or the diversion of control flow. However, for server…
In the present paper, we study the evolution of an overloaded cyclic polling model that starts empty. Exploiting a connection with multitype branching processes, we derive fluid asymptotics for the joint queue length process. Under passage…
We consider a stationary fluid queue with fractional Brownian motion input. Conditional on the workload at time zero being greater than a large value $b$, we provide the limiting distribution for the amount of time that the workload process…
In this paper we study a queue with L\'evy input, without imposing any a priori assumption on the jumps being one-sided. The focus is on computing the transforms of all sorts of quantities related to the transient workload, assuming the…
This paper considers a continuous time analogue of the classical autoregressive moving average processes, L\'evy-driven CARMA processes. First we describe limiting properties of the periodogram by means of the so-called truncated Fourier…
For a stopped diffusion process in a multidimensional time-dependent domain $\D$, we propose and analyse a new procedure consisting in simulating the process with an Euler scheme with step size $\Delta$ and stopping it at discrete times…
A number of biological systems can be modeled by Markov chains. Recently, there has been an increasing concern about when biological systems modeled by Markov chains will perform a dynamic phenomenon called overshoot. In this article, we…
In this paper we consider convergence of moments in the small-time limit theorems for L\'evy processes. We provide precise asymptotics for all the absolute moments of positive order. The convergence of moments in limit theorems holds…
Consider a topological dynamical system $(X, T)$ endowed with the metric $d$. We introduce a novel function as $\overline{BF}(x, y) = \limsup_{n-m \rightarrow +\infty} \inf_{\sigma \in S_{n,m}} \frac{1}{n-m} \sum_{k=m}^{n-1} d\left(T^{k} x,…
In this paper we consider the problem of maximum throughput for tandem queueing system. We modeled this system as a Quasi-Birth-Death process. In order to do this we named level the number of customers waiting in the first buffer (including…
In this note we show that for any given controllable pair (A,B) and any c> 1, a gain matrix K can be chosen so that the transition matrix of the system x' = (A+BK)x decays at the exponential rate exp(-ct) and the overshoot of the transition…
In this paper continuity theorems are established for the number of losses during a busy period of the $M/M/1/n$ queue. We consider an $M/GI/1/n$ queueing system where the service time probability distribution, slightly different in a…