Search arXiv⌕ Search

arXiv · 2610.08622

Agentic RCA for Internet-Scale Services Using Constrained Creativity

Abstract

System administrators of Internet-scale services need to resolve failure incidents to maintain reliability of such services. Ideally, we want a troubleshooting system to be: (1) expressive to known and unknown incidents with high accuracy; (2) cost efficient at scale; (3) explainable to provide actionable insights operators can act on; and (4) entail low effort from the operators. Unfortunately, most existing systems, including emerging LLM-assisted agentic workflows and structured frameworks for authoring diverse RCA algorithms fall short of achieving all four requirements. We present E4, a novel agentic system for troubleshooting for Internet-scale services. E4 embodies the paradigm of constrained creativity that combines the best of LLM-assisted automation and exploration with the explainability and efficiency of a structured approach. Instead of allowing an LLM agent to write arbitrary code or generate arbitrary responses, we provide the agent a restricted DSL to generate its response via simple loop-free data flow programs. This DSL, equipped with high level operators for troubleshooting, makes E4's output accurate, verifiable and explainable. On a mix of synthetic and real-world workloads, E4 achieves up to 62% better accuracy compared to state-of-the-art solutions, while providing more explainable responses at up to 12x reduced cost.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sayan Sinha, Vipul Harsh, B. Aditya Prakash, Vyas Sekar, Hui Zhang. 2026-10-06. Agentic RCA for Internet-Scale Services Using Constrained Creativity. https://arxiv.org/abs/2610.08622

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

KEEP EXPLORING

Related papers

Graph-Based Floor Separation Using Node Embeddings and Clustering of WiFi Trajectories

Indoor positioning systems (IPSs) are increasingly vital for location-based services in complex multi-storey environments. This study proposes a novel graph-based approach for floor separation using Wi-Fi fingerprint trajectories, addressing the challenge of vertical localization in indoor settings. We construct a graph where nodes represent Wi-Fi fingerprints, and edges are weighted by signal similarity and contextual transitions. Node2Vec is employed to generate low-dimensional embeddings, which are subsequently clustered using K-means to identify distinct floors. Evaluated on the Huawei University Challenge 2021 dataset, our method outperforms traditional community detection algorithms, achieving an accuracy of 68.97%, an F1- score of 61.99%, and an Adjusted Rand Index of 57.19%. By publicly releasing the preprocessed dataset and implementation code, this work contributes to advancing research in indoor positioning. The proposed approach demonstrates robustness to signal noise and architectural complexities, offering a scalable solution for floor-level localization.

cs.NI↗

PCDT: A Predictive Cognitive Digital Twin Framework for Intelligent and Autonomous 6G Network Ecosystems

Future 6G networks are expected to operate as intelligent and autonomous ecosystems where monitoring, prediction, and control are integrated into continuous self-optimization loops. However, many digital-twin-based network management approaches still act mainly as synchronized replicas of the network. They observe the state, report degradation, and trigger corrective action only after performance risk has appeared. This leaves a gap between the vision of a cognitive digital twin (CDT) and the behavior of conventional reactive control loops. In this paper, we propose a Predictive Cognitive Digital Twin (PCDT) framework that closes the loop from observation to predictive cognition to proactive resource control. PCDT maintains a persistent traffic world model, forecasts near-future load, and allocates capacity for the predicted horizon peak before a Service Level Agreement (SLA) violation occurs. Evaluated on a real-world traffic trace, PCDT achieves the lowest allocation error among all benchmarked baseline frameworks, reducing MAE by 43% and RMSE by 32% relative to the best baseline (reactive control). Relative to the threshold heuristic, the only baseline with zero violations, PCDT reduces mean allocated capacity by 50%, reconfiguration churn by 56%, and total operating cost by 50%, indicating substantially more efficient performance. These results show the proposed framework advances the digital twin (DT) operation mechanism from a passive representation towards a cognitive, proactive control, and "intent-aware" mechanism aligned with autonomous 6G network vision.

cs.NI↗

Age of Information in Queueing Systems with Merging Server Streams

We present a novel analytical framework for evaluating the age of information (AoI) in multi-path queueing topologies where output streams from multiple servers converge into a single pipeline. This theoretical scenario finds immediate application in ultra-reliable low-latency networks and edge computing architectures, where multi-path routing and stream merging can be vital strategies for maintaining fresh status updates. Specifically, we investigate two setups: a split-merge network and a duplicate-merge network. The split-merge case has been addressed in prior work, but we show that existing studies are incorrect, and our approach provides instead an exact analytical formulation. Moreover, building on similar reasoning, we provide the first formal analysis of the previously unexplored duplicate-merge scenario. Finally, we show how to leverage our theoretical results to solve key system-level optimization problems, deriving the optimal randomized routing probabilities and traffic injection rates that minimize average AoI.

cs.NI↗