Nonlinear axisymmetric liquid currents in spherical annuli

A numerical analysis of non-linear axisymmetric viscous flows in spherical annuli of different gap sizes is presented. Only inner sphere was supposed to rotate at a constant angular velocity. The streamlines, lines of constant angular velocity, kinetic energy spectra, and spectra of velocity components are obtained. A total kinetic energy and torque needed to rotate the inner sphere are calculated as functions of Re for different gap sizes. In small-gap annulus nonuniqueness of steady solutions of Navier-Stokes equations is established and regions of different flow regime existences are found. Numerical solutions in a wide-gap annulus and experimental results are used in conclusions about flow stability in the considered range of Re. The comparison of experimental and numerical results shows close qualitative and quantitative agreement

Fast Jackson-Type Networks with Dynamic Routing

We propose a new class of models of queueing networks with load-balanced dynamic routing. The paper extends earlier works, including [FC], [FMcD], [VDK], where systems with no feedback were considered. The main results are: (a) a sufficient condition for positive recurrence of the arising Markov process and (b) a limiting mean-field picture where the process becomes deterministic and is described by a system of non-linear ODEs

Delay, memory, and messaging tradeoffs in distributed service systems

We consider the following distributed service model: jobs with unit mean, exponentially distributed, and independent processing times arrive as a Poisson process of rate $\lambda n$, with $0<\lambda<1$, and are immediately dispatched by a centralized dispatcher to one of $n$ First-In-First-Out queues associated with $n$ identical servers. The dispatcher is endowed with a finite memory, and with the ability to exchange messages with the servers. We propose and study a resource-constrained "pull-based" dispatching policy that involves two parameters: (i) the number of memory bits available at the dispatcher, and (ii) the average rate at which servers communicate with the dispatcher. We establish (using a fluid limit approach) that the asymptotic, as $n\to\infty$, expected queueing delay is zero when either (i) the number of memory bits grows logarithmically with $n$ and the message rate grows superlinearly with $n$, or (ii) the number of memory bits grows superlogarithmically with $n$ and the message rate is at least $\lambda n$. Furthermore, when the number of memory bits grows only logarithmically with $n$ and the message rate is proportional to $n$, we obtain a closed-form expression for the (now positive) asymptotic delay. Finally, we demonstrate an interesting phase transition in the resource-constrained regime where the asymptotic delay is non-zero. In particular, we show that for any given $\alpha>0$ (no matter how small), if our policy only uses a linear message rate $\alpha n$, the resulting asymptotic delay is upper bounded, uniformly over all $\lambda<1$; this is in sharp contrast to the delay obtained when no messages are used ($\alpha = 0$), which grows as $1/(1-\lambda)$ when $\lambda\uparrow 1$, or when the popular power-of-$d$-choices is used, in which the delay grows as $\log(1/(1-\lambda))$

Large Deviations in Some Queueing Systems

Logarithmic asymptotics of probabilities of large delays are derived for the “last come—first served” system and system with priorities. Trajectories that determine the mean dynamics of arrival flow under the condition of large delay are described

Large deviations provide good approximation to queueing system with dynamic routing

We consider a system with two infinite-buffer FCFS servers (of speed one). The arrivals processes are three independent Poisson flows Ξ_i , of rates λ_i, i = 0, 1, 2, each with IID task service times. The tasks from Ξ_i are directed to server i, i = 1, 2 (dedicated traffic). The tasks from Ξ_0 are directed to the server that has the shorter workload in the buffer at the time of arrival (opportunistic traffic). We compare the analytical data for the large deviation (LD) probabilities for the virtual waiting time in flow Ξ_0 and empercial delay freqencies from simulations

Steady-State Analysis of Load Balancing with Coxian-22 Distributed Service Times

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 distribution. We focus on steady-state performance of load balancing policies in the heavy traffic regime such that the normalized load of system is $\lambda = 1 - N^{-\alpha}$ for $0<\alpha<0.5.$ We identify a set of policies that achieve asymptotic zero waiting. The set of policies include several classical policies such as join-the-shortest-queue (JSQ), join-the-idle-queue (JIQ), idle-one-first (I1F) and power-of-$d$-choices (Po$d$) with $d=O(N^\alpha\log N)$. The proof of the main result is based on Stein's method and state space collapse. A key technical contribution of this paper is the iterative state space collapse approach that leads to a simple generator approximation when applying Stein's method