원문정보
초록
영어
This paper presents an efficient clustering algorithm for faults identification in large telecommunication networks. The alarms and faults in telecommunication networks present
some interesting characteristics like storm and cascade of events. For instance, a single fault
may result in a large number of alarms, and it is often very difficult to isolate the true cause
of a fault. Our algorithm is especially designed for the event correlation problem taking into
account comprehensive information about the system behaviour. Our technique is tested and
compared with some available clustering algorithms on some samples from both simulated
and real data from Ericsson’s network.
목차
1. Introduction
2. The Fault Recognition Problem
3. The Behavioural Proximity Approach
3.1. The Pre-processing Phase
3.2. FECk Algorithm
4. Performance Evaluation
5. Conclusion
References