跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2608.08073 · v2

eIRWR: Enhanced Iterative Random Walk with Restart for Scalable Root Cause Analysis in Microservices

首次提交 2026-08-08 19:34
版本更新 2026-11-16 02:09
雷达观测 2026-11-17 17:12
arXiv ↗PDF ↗

摘要

Root cause analysis (RCA) in microservice systems must find the faulty service behind symptoms that spread across hundreds or thousands of dependent services. Graph-based random walk methods propagate anomaly evidence over the service dependency graph. However, existing anomaly-restart walks restart from the raw anomaly vector, which is often dominated by strongly anomalous downstream victims rather than the less anomalous source. Through a controlled ablation of a basic anomaly-restart walk, the Iterative Random Walk with Restart (IRWR), we show that its ``resilience damping'' is equivalent to a higher restart probability in Personalized PageRank (PPR). Basic IRWR is therefore no stronger than a restart-tuned PPR, which we adopt as a fairer baseline. We then present Enhanced IRWR (eIRWR), which goes beyond restart tuning. It (a)~concentrates restart mass on the most suspicious nodes through power-law sharpening and (b)~adds self-loops and backward edges so that probability accumulates at cascade sources. On three large topologies (12K--25K nodes) from the Alibaba Microservice Trace Dataset, eIRWR is the most accurate of the compared graph-based methods at every level of root-cause visibility. At visibility v=0.3v = 0.3, it reaches a Mean Reciprocal Rank (MRR) of 0.780.78, about four times a restart-tuned PPR and nine times the best other baseline. At high visibility, it reaches MRR\,=0.95= 0.95 and runs in under 30\,ms on graphs with 17K nodes, so it is suitable for online use.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-16 02:09 · 最新观测版本

eIRWR: Enhanced Iterative Random Walk with Restart for Scalable Root Cause Analysis in Microservices

Root cause analysis (RCA) in microservice systems must find the faulty service behind symptoms that spread across hundreds or thousands of dependent services. Graph-based random walk methods propagate anomaly evidence over the service dependency graph. However, existing anomaly-restart walks restart from the raw anomaly vector, which is often dominated by strongly anomalous downstream victims rather than the less anomalous source. Through a controlled ablation of a basic anomaly-restart walk, the Iterative Random Walk with Restart (IRWR), we show that its ``resilience damping'' is equivalent to a higher restart probability in Personalized PageRank (PPR). Basic IRWR is therefore no stronger than a restart-tuned PPR, which we adopt as a fairer baseline. We then present Enhanced IRWR (eIRWR), which goes beyond restart tuning. It (a)~concentrates restart mass on the most suspicious nodes through power-law sharpening and (b)~adds self-loops and backward edges so that probability accumulates at cascade sources. On three large topologies (12K--25K nodes) from the Alibaba Microservice Trace Dataset, eIRWR is the most accurate of the compared graph-based methods at every level of root-cause visibility. At visibility v=0.3v = 0.3, it reaches a Mean Reciprocal Rank (MRR) of 0.780.78, about four times a restart-tuned PPR and nine times the best other baseline. At high visibility, it reaches MRR\,=0.95= 0.95 and runs in under 30\,ms on graphs with 17K nodes, so it is suitable for online use.

查看此版本解读 →查看此版本原文 ↗