惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

J
Java Code Geeks
Google DeepMind News
Google DeepMind News
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
小众软件
小众软件
Blog — PlanetScale
Blog — PlanetScale
腾讯CDC
A
About on SuperTechFans
Vercel News
Vercel News
I
InfoQ
阮一峰的网络日志
阮一峰的网络日志
月光博客
月光博客
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
人人都是产品经理
人人都是产品经理
S
SegmentFault 最新的问题
V
Visual Studio Blog
T
Tailwind CSS Blog
大猫的无限游戏
大猫的无限游戏
M
MIT News - Artificial intelligence
博客园 - 【当耐特】
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Microsoft Azure Blog
Microsoft Azure Blog
Apple Machine Learning Research
Apple Machine Learning Research
GbyAI
GbyAI
美团技术团队

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Queueing models with random resetting
[Submitted on 30 Apr 2025 (v1), last revised 17 Aug 2026 (this v · 2025-05-01 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:We introduce and study some queueing models with random resetting, including Markovian and non--Markovian models under the first-come first-served (FCFS) discipline. The Markovian models include M/M/$r$ and M/M/1+M queues with random resetting, in which a continuous-time Markov chain is formulated, with transitions including a resetting to state zero in addition to arrivals and services. We explicitly characterize the stationary distributions of the queueing processes in these models by using parting balance equations. We derive expressions for standard performance measures such as the delay probability, expected queue length and waiting time, as well as probability of a customer completing service before resetting in the M/M/$r$ model, and probability of abandonment before service or resetting in the M/M/1+M model.
The non--Markovian models include GI/GI/1, GI/GI/$r$ and GI/GI/$\infty$ queues with random resetting to state zero at arrival times. For GI/GI/1 and GI/GI/$r$ queues under the FCFS discipline, we introduce modified Lindley and Kiefer--Wolfowitz recursions, respectively. Using an operator representation for these recursions, we characterize the stationary distributions via convergent series, as solutions to the modified Wiener--Hopf equations. For GI/GI/$\infty$ queues with resettings, we utilize a version of the Kiefer--Wolfowitz recursion, and also characterize the corresponding stationary distribution.

Submission history

From: Guodong Pang [view email]
[v1] Wed, 30 Apr 2025 21:50:51 UTC (21 KB)
[v2] Tue, 18 Nov 2025 01:44:02 UTC (40 KB)
[v3] Tue, 25 Nov 2025 20:08:02 UTC (42 KB)
[v4] Mon, 17 Aug 2026 22:25:11 UTC (42 KB)