Newest papers

Every Alarm Has a Cause: An Open Generator of Telecom Alarm Storms with Exact Root Causes, Bound to NORIA-O, RFC 8632 and TMF642

Madhulatha Mandarapu, Sandeep Kunkunuru · 2026 · arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.30004 · cited by 0 works (OpenAlex) · open-access PDF

Japanese

アラームコア・オペレーターのコア・アナリティクスは、共有できないデータに基づいて研究されています。オペレーターのログは機密であるため、フィールドが公開するものは、アラームタイプの間の因果グラフであり、偶発的な原因ではなく、固定したシナリオセット、ゲートまたは決してリリースされない。最近の2つのベンチマークは、スケールで偶発的な根源の原因を持ちます。発行されたフィールドはNORIA-O、RFC 8632, RFC 8345またはTMF642の定義に結びつきません。データセットではなくジェネレーターを提供します。それはインターネットトポロジー動物園からの実際のバックボーントポロジーで実行され、すべてのアラームの正確

Machine translation (Meta M2M100); the English original follows.

Abstract

Alarm root-cause analysis is studied on data that cannot be shared. Operator logs are confidential, so what the field publishes is a causal graph between alarm types rather than per-incident causes, a fixed scenario set, gated, or never released. Two recent benchmarks carry per-incident root causes at scale; neither states a download location or a licence. We give a generator rather than a dataset. It runs on real backbone topologies from the Internet Topology Zoo and records the exact root cause and the propagation path of every alarm -- a by-product of generation, not a labelling pass. Every emitted field binds to a term in NORIA-O, RFC 8632, RFC 8345 or TMF642, and an unknown term fails the run. We ship fixed configurations, splits, a scorer and nine baselines. A one-line rule -- rank the device that raised the earliest critical alarm -- takes top-1 at 0.650 against 0.575 for our own temporal method, and wins 13 of 15 runs over three backbones and five seeds. An LLM given the same view reaches 0.600, the same model allowed to query the graph 0.625, and the rule wins on real operator alarms too, at 0.773: a property of alarm streams, not of our generator. One fault class separates the table: when a site loses power its PoP reports nothing, so every method that ranks alarmed devices scores 0.000 or near it, while the two that walk the topology to a silent candidate take 1.000 and 0.833.

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Topics: Computer science, ALARM, Topology (electrical circuits), Operator (biology), Generator (circuit theory), Graph

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange