Related papers: A one-dimensional diffusion model for overloaded q…
We consider an automatic overload control for two large service systems modeled as multi-server queues, such as call centers. We assume that the two systems are designed to operate independently, but want to help each other respond to…
The problem of exact evaluation of the mean service cycle time in tandem systems of single-server queues with both infinite and finite buffers is considered. It is assumed that the interarrival and service times of customers form sequences…
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…
We analyze a data-processing system with $n$ clients producing jobs which are processed in \textit{batches} by $m$ parallel servers; the system throughput critically depends on the batch size and a corresponding sub-additive speedup…
We consider a one-dimensional stochastic reaction-diffusion generalizing the totally asymmetric simple exclusion process, and aiming at describing single lane roads with vehicles that can change speed. To each particle is associated a jump…
We study the long time behavior of an advection-diffusion equation with a random shear flow which depends on a stationary Ornstein-Uhlenbeck (OU) process in parallel-plate channels enforcing the no-flux boundary conditions. We derive a…
We consider Ornstein-Uhlenbeck processes (OU-processes) associated to hypoelliptic diffusion processes on finite-dimensional Lie groups: let $ \mathcal{L} $ be a hypoelliptic, left-invariant ``sum of the squares''-operator on a Lie group $…
The tandem fluid queueing model is a useful tool for performance analysis and control design for a variety of transportation systems. In this article, we study the joint impact of stochastic capacity and spillback on the long-time…
Superpositions of Ornstein-Uhlenbeck type (supOU) processes provide a rich class of stationary stochastic processes for which the marginal distribution and the dependence structure may be modeled independently. We show that they can also…
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…
In vivo measurements of the passive movements of biomolecules or vesicles in cells consistently report ''anomalous diffusion'', where mean-squared displacements scale as a power law of time with exponent $\alpha< 1$ (subdiffusion). While…
We consider the problem of scheduling a queueing system in which many statistically identical servers cater to several classes of impatient customers. Service times and impatience clocks are exponential while arrival processes are renewal.…
The discrete time queueing system is highly applicable to modern telecommunication systems, where it provides adaptive packet handling, congestion controlled security/inspection, energy efficient operation, and supports bursty traffic…
A fundamental challenge in large-scale cloud networks and data centers is to achieve highly efficient server utilization and limit energy consumption, while providing excellent user-perceived performance in the presence of uncertain and…
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…
We study the Dyson-Ornstein-Uhlenbeck diffusion process, an evolving gas of interacting particles. Its invariant law is the beta Hermite ensemble of random matrix theory, a non-product log-concave distribution. We explore the convergence to…
The focus of this paper is on the asymptotics of large-time numbers of customers in time-periodic Markovian many-server queues with customer abandonment in heavy traffic. Limit theorems are obtained for the periodic number-of-customers…
In traditional priority queues, we assume that every customer upon arrival has a fixed, class-dependent priority, and that a customer may not commence service if a customer with a higher priority is present in the queue. However, in…
In this paper, we analyse a single server polling model with two queues. Customers arrive at the two queues according to two independent Poisson processes. There is a single server that serves both queues with generally distributed service…
In this work, we analyze the steady-state maximum overlap time distribution in a single-server queue by introducing a dependence structure between service and interarrival times under the Farlie-Gumber-Morgenstern copula. We provide…