Related papers: L\'evy-driven polling systems and continuous-state…
Motivated by the growing interest in today's massive parallel computing capabilities we analyze a queueing network with many servers in parallel to which jobs arrive a according to a Poisson process. Each job, upon arrival, is split into…
We consider a Markovian single server queue in which customers are preemptively scheduled by exogenously assigned priority levels. The novelty in our model is that the priority levels are randomly assigned from a continuous probability…
A general continuous-state branching processes in random environment (CBRE-process) is defined as the strong solution of a stochastic integral equation. The environment is determined by a L\'evy process with no jump less than $-1$. We give…
In this article, we introduce Mittag-Leffler L\'evy process and provide two alternative representations of this process. First, in terms of Laplace transform of the marginal densities and next as a subordinated stochastic process. Both…
We consider a class of L\'evy-type processes derived via a Doob-transform from L\'evy processes conditioned by a control function called potential. These processes have position-dependent and generally unbounded components, with stationary…
While queueing network models are powerful tools for analyzing service systems, they traditionally require substantial human effort and domain expertise to construct. To make this modeling approach more scalable and accessible, we propose a…
A branching L\'evy process can be seen as the continuous-time version of a branching random walk. It describes a particle system on the real line in which particles move and reproduce independently in a Poissonian manner. Just as for L\'evy…
The concept of a L\'evy subordinator is generalized to a family of non-decreasing stochastic processes, which are parameterized in terms of two Bernstein functions. Whereas the independent increments property is only maintained in the…
We study an open discrete-time queueing network that models the collection of data in a multi-hop sensor network. We assume data is generated at the sensor nodes as a discrete-time Bernoulli process. All nodes in the network maintain a…
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…
Motivated by the stochastic Lotka-Volterra model, we introduce discrete-state interacting multitype branching processes. We show that they can be obtained as the sum of a multidimensional random walk with a Lamperti-type change proportional…
We study a one-dimensional kinetic stochastic model driven by a L{\'e}vy process with a non-linear time-inhomogeneous drift. More precisely, the process $(V,X)$ is considered, where $X$ is the position of the particle and its velocity $V$…
In this paper, we analyze a discrete-time queue that is motivated from studying hospital inpatient flow management, where the customer count process captures the midnight inpatient census. The stationary distribution of the customer count…
In this paper we study the problem of statistical inference for a continuous-time moving average L\'evy process of the form $$Z_{t} = \int_{\mathbb{R}}\mathcal{K}(t-s)\, dL_{s},\quad t\in\mathbb{R}$$ with a deterministic kernel (\K\) and a…
Randomized load-balancing algorithms play an important role in improving performance in large-scale networks at relatively low computational cost. A common model of such a system is a network of $N$ parallel queues in which incoming jobs…
Two independent Poisson streams of jobs flow into a single-server service system having a limited common buffer that can hold at most one job. If a type-i job (i=1,2) finds the server busy, it is blocked and routed to a separate type-i…
We use multidimensional diffusion processes to approximate the dynamics of a queue served by many parallel servers. The queue is served in the first-in-first-out (FIFO) order and the customers waiting in queue may abandon the system without…
We consider predictive inference using a class of temporally dependent Dirichlet processes driven by Fleming--Viot diffusions, which have a natural bearing in Bayesian nonparametrics and lend the resulting family of random probability…
In this article, we first review the connection between L\'evy processes and infinitely divisible random variables, and the classification of infinitely divisible distributions. Using this connection and the L\'evy-Khinchine representation…
Max-algebra models of tandem single-server queueing systems with both finite and infinite buffers are developed. The dynamics of each system is described by a linear vector state equation similar to those in the conventional linear systems…