Related papers: Scaling limits via excursion theory: Interplay bet…
In this paper one presents method for the computation of convergence bounds for four classes of multiserver queueing systems, described by inhomogeneous Markov chains. Specifically one considers inhomogeneous $M/M/S$ queueing system with…
In this thesis, branching Brownian motion (BBM) is a random particle system where the particles diffuse on the real line according to Brownian motions and branch at constant rate into a random number of particles with expectation greater…
We consider multiclass feedforward queueing networks with first in first out and priority service disciplines at the nodes, and class dependent deterministic routing between nodes. The random behavior of the network is constructed from…
It is known that after scaling a random Motzkin path converges to a Brownian excursion. We prove that the fluctuations of the counting processes of the ascent steps, the descent steps and the level steps converge jointly to linear…
In this paper, we firstly give a reconstruction for Crump-Mode-Jagers processes with immigration as solutions to a class of stochastic Volterra integral equations, which offers us a new insight for the evolution dynamics of age-dependent…
Service systems like data centers and ride-hailing are popularly modeled as queueing systems in the literature. Such systems are primarily studied in the steady state due to their analytical tractability. However, almost all applications in…
This is an expository review paper illustrating the ``martingale method'' for proving many-server heavy-traffic stochastic-process limits for queueing models, supporting diffusion-process approximations. Careful treatment is given to an…
We study discrete-time stochastic processes $(X_t)$ on $[0,\infty)$ with asymptotically zero mean drifts. Specifically, we consider the critical (Lamperti-type) situation in which the mean drift at $x$ is about $c/x$. Our focus is the…
We introduce a queueing system that alternates between two modes, so-called {\it working mode} and {\it vacation mode}. During the working mode the system runs as an $M^{X}/G/1$ queue. Once the number of customers in the working mode drops…
We study a single server FIFO queue that offers general service. Each of n customers enter the queue at random time epochs that are inde- pendent and identically distributed. We call this the random scattering traffic model, and the…
We study the generalization of the G/G/1 queue obtained by relaxing the assumption of independence between inter-arrival times and service requirements. The analysis is carried out for the class of multivariate matrix exponential…
We develop a heavy traffic diffusion limit theorem under nonstandard spatial scaling for the queue length process in a single server queue employing shortest remaining processing time (SRPT). For processing time distributions with unbounded…
In this paper, we display methods for the computation of convergence and perturbation bounds for $M_t/M_t/1$ system with balking, catastrophes, server failures and repairs. Based on the logarithmic norm of linear operators, the bounds on…
We consider the $M/G/1$ queue with a processor sharing server. We study the conditional sojourn time distribution, conditioned on the customer's service requirement, as well as the unconditional distribution, in various asymptotic limits.…
We prove a heavy traffic scaling limit for a shortest remaining processing time queue. We are interested in the case where the processing time distribution has a tail that decays rapidly, i.e., has light tails. In particular, we revisit the…
Researching elliptic analogues for equalities and formulas is a new trend in enumerative combinatorics which has followed the previous trend of studying $q$-analogues. Recently Schlosser proposed a lattice path model in the square lattice…
In this paper we initiate the theory of Crump-Mode-Jagers branching processes (BP) in the setting where no Malthusian parameter exist, i.e., the process grows faster than exponential. A Crump-Mode-Jagers BP is a branching process (in…
We consider the long-range random conductance model on $\mathbb{Z}^d$ at the critical exponent: the jump rate between sites $x$ and $y$ decays as $\mathbf{a}(x,y) |x-y|^{-(d+2)}$, where $\mathbf{a}(x,y)$ are i.i.d. uniformly elliptic…
Various empirical and theoretical studies indicate that cumulative network traffic is a Gaussian process. However, depending on whether the intensity at which sessions are initiated is large or small relative to the session duration tail,…
Vacation queueing systems are widely used as an extension of the classical queueing theory. We consider both working vacations and regular vacations in this paper, and compare systems with vacations to the regular $M/M/1$ system via mean…