Skip navigation
Please use this identifier to cite or link to this item: https://repository.esi-sba.dz/jspui/handle/123456789/999
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRAMLA, YAssine-
dc.date.accessioned2026-10-08T07:41:26Z-
dc.date.available2026-10-08T07:41:26Z-
dc.date.issued2026-
dc.identifier.urihttps://repository.esi-sba.dz/jspui/handle/123456789/999-
dc.descriptionEncadreur :Dr. KHALDI Belkacemen_US
dc.description.abstractThe fault management of a mobile network produces a large flow of alarms. One fault is often reported by many alarms on several elements, and the engineers of the network operations center must find which alarms belong together and where the fault lies. This work, carried out at Ooredoo Algeria, studies three tasks on one export of the operator’s alarm log: next-alarm prediction, alarm correlation and root-cause identification. The topology of the network links the three tasks. We first present the background of these tasks: mobile networks and alarms, the data mining methods used for correlation, and the sequence and graph models used for prediction. We then build two network graphs from the alarms themselves, one between managed elements and one between sites. For prediction, we train sequence models of the next alarm code and add graph information to them in three forms: static graph embeddings, dynamic graph features, and attention over the active alarms of neighbouring elements, all under the same leakage controls. Predicting the next element instead was tried and paused after a negative result. For correlation, we mine a catalogue of statistically tested rules between alarm codes at several topological distances and use it in a correlator that groups the alarm stream into incidents. For root cause, we name the root site and the root alarm of each incident. The export covers about 11 hours: 99% of its alarms fall on one day. On this data, no graph model beat the sequence model by more than the measured noise floor of 0.015 macro F1, and diagnostics trace this negative result to the small number of examples per alarm code, not to the models. The graph is useful instead for grouping and locating alarms. On the test period, the correlator reduces the number of items to handle by a factor of 9.0 and keeps 89.1% of the vendor’s root–child links inside one incident. The root-cause method names the right site in 18 of 19 labelled incidents, against 13 for the site of the earliest alarm. We also design the application that would run these methods in the network operations center.en_US
dc.language.isoenen_US
dc.subjectFault Managementen_US
dc.subjectAlarm Correlationen_US
dc.subjectRoot-cause Analysisen_US
dc.subjectAlarm Predictionen_US
dc.subjectGraph Neural Networksen_US
dc.subjectAssociation Rulesen_US
dc.subjectMobile Networksen_US
dc.titleIntelligent Alarm Management for Telecom Networks: Real-Time Correlation, Root Cause Identification, and Cascade Prediction Using Graph Neural Networksen_US
dc.typeThesisen_US
Appears in Collections:Ingenieur

Files in This Item:
File Description SizeFormat 
pfe-report-1-1.pdf142,82 kBAdobe PDFView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.