Search arXiv⌕ Search

arXiv · 2610.12716

Tandem Queues with Hybrid Abandonment in Heavy Traffic

Abstract

Hybrid-abandonment systems, where jobs abandon from certain stages of service but not others, occur frequently in medical, service, and computing systems. Abandonment affects the heavy-traffic behavior of both the stages with and without abandonment. In contrast to existing heavy-traffic works that focus on cases where there is abandonment at either all stages or no stages, we focus on the heavy-traffic behavior for these hybrid-abandonment systems. We provide the first heavy-traffic characterization of the second queue length in a two-stage tandem queue with abandonment only in the first stage. We characterize the scaled mean of the second stage queue length and prove that the scaled second queue length is asymptotically exponentially distributed and asymptotically independent of the first stage queue length. We derive our results by analyzing Markovian arrival process queues with countably infinite phases. We do this by extending techniques used to analyze queues with Markov-modulated arrivals to the broader class of infinite Markovian arrival process queues. We prove asymptotic results for a more general infinite phase process condition, an infinite birth-death phase process, and the hybrid-abandonment tandem case. We also empirically demonstrate that our heavy-traffic approximations are good approximations across various system settings.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cameron Curtis, Izzy Grosof, Seyed Iravani. 2026-10-08. Tandem Queues with Hybrid Abandonment in Heavy Traffic. https://arxiv.org/abs/2610.12716

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

KEEP EXPLORING

Related papers

Efficient Fault Localization in a Cloud Stack Using End-to-End Application Service Topology

Cloud application services are distributed and have components across the stack working together to deliver the end-user experience. The widespread adoption of microservice architecture exacerbates failure management due to the increased number of service components. To be effective, strategies to enhance application service resilience need to be autonomous and developed at the service granularity, considering its end-to-end components. However, the massive amount of observability data generated by all these components across the service stack poses a significant challenge in reacting to anomalies and restoring the service quality in real time. Towards this end, the article presents the Topology-Aware Root Cause Detection (TA-RCD) algorithm, which leverages the end-to-end application service topology to accurately pinpoint root causes and facilitate swift remediation of cloud service anomalies. Additionally, because effective root-cause localization depends on identifying the most informative observability signals across the cloud service stack, this article presents a topology-guided metric selection strategy that selects relevant metrics from end-to-end layers to enable efficient, explainable, and accurate anomaly remediation. TA-RCD is comprehensively evaluated on the public RCAEval benchmark and a controlled in-house testbed. Experimental results show that the proposed approach consistently achieves higher average Top-3 and Top-5 localization accuracy than state-of-the-art baselines, improving AC@5 by at least 2$\times$ and AC@3 by at least 4$\times$ over standard RCD in the controlled testbed. On the public RCAEval benchmark, TA-RCD further improves metric-level AC@5 by 18\% and Avg@5 by 19\% over the strongest baseline.

cs.PF↗

Outperforming Multiserver SRPT at All Loads

A well-designed scheduling policy can unlock significant performance improvements with no additional resources. Multiserver SRPT (SRPT-k) is known to achieve asymptotically optimal mean response time in the heavy-traffic limit, as load approaches capacity. No better policy is known for the M/G/k queue in any regime. We introduce a new policy, SRPT-Except-k+1 & Modified SRPT (SEK-SMOD), which is the first policy to provably achieve lower mean response time than SRPT-k. SEK-SMOD outperforms SRPT-k across all loads and all job size distributions. The key idea behind SEK-SMOD is to prioritize large jobs over small jobs in specific scenarios to improve server utilization, and thereby improve the response time of subsequent jobs in expectation. Our proof is a novel application of hybrid worst-case and stochastic techniques to relative analysis, where we analyze the deviations of our proposed SEK-SMOD policy away from the SRPT-k baseline policy. Furthermore, we design Practical SEK (a simplified variant of SEK-SMOD) and empirically verify the improvement over SRPT-k via simulation.

cs.PF↗

Reproducible LLM Inference Benchmarking: A Sequential Isolation Protocol for Regression Testing

Reproducible benchmarking of Large Language Model (LLM) inference is challenging because repeated measurements can vary with execution and system state. We present the Sequential Isolation Methodology, a controlled benchmarking and regression-testing protocol designed to reduce between-run measurement variance while deliberately varying workload concurrency. We evaluate three representative open-source LLMs on an NVIDIA A100 80GB GPU using vLLM 0.9.1 across six context sizes and eight concurrency levels, with five repetitions per configuration. The final protocol reduces average coefficient of variation (CV) from 15.2% in the least controlled methodology stage to 2.2% under the final protocol; using CV computed across the five repetition-level median (P50) TTFT values per configuration, 113 of 144 configurations (78.5%) achieve CV below 3%. The measurements also show a marked latency transition between 200 and 500 concurrent users on the tested stack and descriptive differences in P99 latency across the three models. We additionally provide an explicit cost break-even model with sensitivity to API pricing. The protocol is intended to provide a stable reference for reproducible comparison and regression testing rather than to predict absolute behavior under uncontrolled production traffic. Infrastructure-as-Code and benchmark scripts support replication of the experimental environment.

cs.PF↗