Related papers: Fluid Limits for Time-Varying Many-Server Queues w…
We present a heavy traffic analysis for a single server queue with renewal arrivals and generally distributed i.i.d. service times, in which the server employs the Shortest Remaining Processing Time (SRPT) policy. Under typical heavy…
We consider a multihop wireless system. There are multiple source-destination pairs. The data from a source may have to pass through multiple nodes. We obtain a channel scheduling policy which can guarantee end-to-end mean delay for the…
Motivated by call center practice, we propose a tractable model for $\mbox{GI}/\mbox{GI}/n+\mbox{GI}$ queues in the efficiency-driven (ED) regime. We use a one-dimensional diffusion process to approximate the virtual waiting time process…
The present paper is concerned with the well-posedness theory for non-homogeneous incompressible fluids exhibiting odd (non-dissipative) viscosity effects. Differently from previous works, we consider here the full odd viscosity tensor.…
We study in this paper a variation of the acclaimed CSMA random access protocol. We will focus on the case where back-off rates at each node is polynomial in the size of the queue. Under a condition relating the exponent in the polynomial…
The purpose of this paper is to study the existence, uniqueness and lifespan of solutions for a fractional Stokes-Transport system. This problem should be understood as a model for sedimentation in a fluid where the viscosity law is given…
Arrival processes to service systems often display fluctuations that are larger than anticipated under the Poisson assumption, a phenomenon that is referred to as overdispersion. Motivated by this, we analyze a class of discrete stochastic…
Multiserver jobs, which are jobs that occupy multiple servers simultaneously during service, are prevalent in today's computing clusters. But little is known about the delay performance of systems with multiserver jobs. We consider queueing…
We extend the measure-valued fluid model, which tracks residuals of patience and service times, to allow for time-varying arrivals. The fluid model can be characterized by a one-dimensional convolution equation involving both the patience…
In this paper, we extend our study of mass transport in multicomponent isothermal fluids to the incompressible case. For a mixture, incompressibility is defined as the independence of average volume on pressure, and a weighted sum of the…
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…
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…
Multi-Class Processing Networks describe a set of servers that perform multiple classes of jobs on different items. A useful and tractable way to find an optimal control for such a network is to approximate it by a fluid model, resulting in…
The PS-model treated in this paper is motivated by freelance job websites where multiple freelancers compete for a single job. In the context of such websites, multistage service of a job means collection of applications from multiple…
This paper studies the diffusion limit for a network of infinite-server queues operating under Markov modulation (meaning that the system's parameters depend on an autonomously evolving background process). In previous papers on (primarily…
We consider a chemotaxis-fluid system involving nonlinear cell diffusion of porous medium type, signal consumption by cells, and rather general, possibly matrix-valued, chemotactic sensitivities. It is shown that if the corresponding…
This paper studies load balancing for many-server ($N$ servers) systems. Each server has a buffer of size $b-1,$ and can have at most one job in service and $b-1$ jobs in the buffer. The service time of a job follows the Coxian-2…
We consider a system of $N$ identical server pools and a single dispatcher where tasks arrive as a Poisson process of rate $\lambda(N)$. Arriving tasks cannot be queued, and must immediately be assigned to one of the server pools to start…
We study a sequence of single server queues with customer abandonment (GI/GI/1+GI) under heavy traffic. The patience time distributions vary with the sequence, which allows for a wider scope of applications. It is known ([20, 18]) that the…
A large-scale service system with multiple customer classes and multiple server pools is considered, with the mean service time depending both on the customer class and server pool. The allowed activities (routing choices) form a tree (in…