Related papers: Distribution-valued heavy-traffic limits for the $…
We study an ordinary differential equation (ODE) arising as the many-server heavy-traffic fluid limit of a sequence of overloaded Markovian queueing models with two customer classes and two service pools. The system, known as the X model in…
We study many-server queues with abandonment in which customers have general service and patience time distributions. The dynamics of the system are modeled using measure- valued processes, to keep track of the residual service and patience…
We consider open multi-class queueing networks with general arrival processes, general processing time sequences and Bernoulli routing. The network is assumed to be operating under an arbitrary work-conserving scheduling policy that makes…
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,…
We study large deviations for the time average of the Ornstein-Uhlenbeck process raised to an arbitrary power. We prove that beyond a critical value, large deviations are subexponential in time, with a non-convex rate function whose main…
We introduce a unified framework for solving first passage times of time-homogeneous diffusion processes. According to the killed version potential theory and the perturbation theory, we are able to deduce closed-form solutions for…
A multi-class single-server queueing model with finite buffers, in which scheduling and admission of customers are subject to control, is studied in the moderate deviation heavy traffic regime. A risk-sensitive cost set over a finite time…
We consider an $M/G/\infty$ queue with infinite expected service time. We then provide the transience/recurrence classification of the states (the system is said to be at state $n$ if there are $n$ customers being served), observing also…
This paper studies subordinate Ornstein-Uhlenbeck (OU) processes, i.e., OU diffusions time changed by L\'{e}vy subordinators. We construct their sample path decomposition, show that they possess mean-reverting jumps, study their equivalent…
We consider a hybrid diffusion process that is a combination of two Ornstein-Uhlenbeck processes with different restraining forces. This process serves as the heavy-traffic approximation to the Markovian many-server queue with abandonments…
We study the positive recurrence of piecewise Ornstein-Uhlenbeck (OU) diffusion processes, which arise from many-server queueing systems with phase-type service requirements. These diffusion processes exhibit different behavior in two…
The model is a "generalized switch", serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, which determines the probability distribution of the…
This paper studies the heavy-traffic (HT) behaviour of queueing networks with a single roving server. External customers arrive at the queues according to independent renewal processes and after completing service, a customer either leaves…
We consider a one-dimensional stationary stochastic process $x(\tau)$ of duration $T$. We study the probability density function (PDF) $P(t_{\rm m}|T)$ of the time $t_{\rm m}$ at which $x(\tau)$ reaches its global maximum. By using a path…
We introduce and study a class of probabilistic generative models, where the latent object is a finite-dimensional diffusion process on a finite time interval and the observed variable is drawn conditionally on the terminal point of the…
In this paper we analyze the distributional properties of a busy period in an on-off fluid queue and the a first passage time in a fluid queue driven by a finite state Markov process. In particular, we show that in Anick-Mitra-Sondhi model…
In this paper, we investigate the number of customers that overlap or coincide with a virtual customer in an Erlang-A queue. Our study provides a novel approach that exploits fluid and diffusion limits for the queue to approximate the mean…
Let $Y$ be an Ornstein-Uhlenbeck diffusion governed by an ergodic finite state Markov process $X$: $dY_t=-\lambda(X_t)Y_tdt+\sigma(X_t)dB_t$, $Y_0$ given. Under ergodicity condition, we get quantitative estimates for the long time behavior…
Motivated by application in wireless networks, cloud computing, data centers etc, Stochastic Processing Networks have been studied in the literature under various asymptotic regimes. In the heavy-traffic regime, the steady state mean queue…
Consider a system performing a continuous-time random walk on the integers, subject to catastrophes occurring at constant rate, and followed by exponentially-distributed repair times. After any repair the system starts anew from state zero.…