Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2111.02097

Mitigating long queues and waiting times with service resetting

Ofek Lauber Bonomo·Arnab Pal·Shlomi Reuveni
View original source ↗Read source document ↗Export metadata ↓

Abstract

What determines the average length of a queue which stretches in front of a service station? The answer to this question clearly depends on the average rate at which jobs arrive at the queue and on the average rate of service. Somewhat less obvious is the fact that stochastic fluctuations in service and arrival times are also important, and that these are a major source of backlogs and delays. Strategies that could mitigate fluctuations induced delays are in high demand as queue structures appear in various natural and man-made systems. Here we demonstrate that a simple service resetting mechanism can reverse the deleterious effects of large fluctuations in service times, thus turning a marked drawback into a favourable advantage. This happens when stochastic fluctuations are intrinsic to the server, and we show that the added feature of service resetting can then dramatically cut down average queue lengths and waiting times. While the analysis presented herein is based on the M/G/1 queueing model where service is general but arrivals are assumed to be Markovian, Kingman's formula asserts that the benefits of service resetting will carry over to queues with general arrivals. We thus expect results coming from this work to find widespread application to queueing systems ranging from telecommunications, via computing, and all the way to molecular queues that emerge in enzymatic and metabolic cycles of living organisms.

Explore related subjects

cond-mat.stat-mechmath.OCmath.PRphysics.bio-phphysics.chem-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ofek Lauber Bonomo, Arnab Pal, Shlomi Reuveni. 2021-11-03. Mitigating long queues and waiting times with service resetting. https://doi.org/10.1093/pnasnexus%2Fpgac070

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech↗
arXiv2026

Information-Theoretic Characterization of Macroscopic Chaos Emerging from the Chemical Master Equation

Open chemical reaction networks exhibit stochastic concentration dynamics at finite system sizes, whereas their macroscopic limit is governed by deterministic rate equations that can display chaos. In this Letter, we show theoretically that a rate of information loss constructed from two-time mutual information recovers the Kolmogorov-Sinai entropy in the deterministic limit. We verify this result through numerical simulations of a Markov jump process for a three-species system involving seven reactions.

cond-mat.stat-mech↗
arXiv2026

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.

cond-mat.stat-mech↗