Related papers: Join-the-Shortest Queue Diffusion Limit in Halfin-…
In this paper we study a two-queue polling model with zero switch-over times and $k$-limited service (serve at most $k_i$ customers during one visit period to queue $i$, $i=1,2$) in each queue. The arrival processes at the two queues are…
The upper bound for the convergence rate of the distribution of the state of a queuing system with infinitely many servers is obtained, in the case when the intensity of the incoming flow and the intensity of the service depend on the state…
We study numerically statistical distributions of sums of orbit coordinates, viewed as independent random variables in the spirit of the Central Limit Theorem, in weakly chaotic regimes associated with the excitation of the first ($k=1$)…
In this paper we study the uniform stability properties of two classes of parallel server networks with multiple classes of jobs and multiple server pools of a tree topology. These include a class of networks with a single non-leaf server…
In this paper, we study a stochastically driven non-equilibrium quantum system where the driving protocols consist of hopping and waiting processes. The waiting times between two hopping processes satisfy a heavy-tailed distribution. By…
We consider the following distributed service model: jobs with unit mean, general distribution, and independent processing times arrive as a renewal process of rate $\lambda n$, with $0<\lambda<1$, and are immediately dispatched to one of…
Motivated by a web-server model, we present a queueing network consisting of two layers. The first layer incorporates the arrival of customers at a network of two single-server nodes. We assume that the inter-arrival and the service times…
One-dimensional non-equilibrium models of particles subjected to a coagulation-diffusion process are important in understanding non-equilibrium dynamics, and fluctuation-dissipation relation. We consider in this paper transport properties…
This paper presents a heavy-traffic analysis of the behavior of a single-server queue under an Earliest-Deadline-First (EDF) scheduling policy in which customers have deadlines and are served only until their deadlines elapse. The…
We discuss the diffusion phenomenon in the parabolic and hyperbolic regimes. New effects related to the finite velocity of the diffusion process are predicted, that can partially explain the strange behavior associated to adsorption…
The present paper is devoted to the investigation of the long term behavior of a class of singular multi-dimensional diffusion processes that get absorbed in finite time with probability one. Our focus is on the analysis of quasi-stationary…
Diffusion processes have been widely used for approximations in the queueing theory. There are different types of diffusion approximations. Among them, we are interested in those obtained through limits of a sequence of models which…
In 1987, J.W. Cohen analyzed the so-called Serve the Longest Queue (SLQ) queueing system, where a single server attends two non-symmetric $M/G/1$-type queues, exercising a non-preemptive priority switching policy. Cohen further analyzed in…
In a first part, we prove a Lyapunov-type criterion for the $\xi\_1$-positive recurrence of absorbed birth and death processes and provide new results on the domain of attraction of the minimal quasi-stationary distribution. In a second…
We study the non-Arrhenius behavior of surface diffusion near the second-order phase transition boundary of an adsorbate layer. In contrast to expectations based on macroscopic thermodynamic effects, we show that this behavior can be…
This paper contains an asymptotic analysis of a fluid model for a heavily loaded processor sharing queue. Specifically, we consider the behavior of solutions of critical fluid models as time approaches \infty. The main theorems of the paper…
This paper studies the effect of an overdispersed arrival process on the performance of an infinite-server system. In our setup, a random environment is modeled by drawing an arrival rate $\Lambda$ from a given distribution every $\Delta$…
Heavy-traffic limit theory deals with queues that operate close to criticality and face severe queueing times. Let $W$ denote the steady-state waiting time in the ${\rm GI}/{\rm G}/1$ queue. Kingman (1961) showed that $W$, when…
This paper examines a continuous-time routing system with general interarrival and service time distributions, operating under the join-the-shortest-queue and power-of-two-choices policies. Under a weaker set of assumptions than those…
We consider a class of multi-agent distributed synchronization systems, which are modeled as $n$ particles moving on the real line. This class generalizes the model of a multi-server queueing system, considered in [15], employing so-called…