| Topographical proximity for mining network alarm data |
| Full text |
Pdf
(260 KB)
|
| Source
|
Joint International Conference on Measurement and Modeling of Computer Systems
archive
Proceedings of the 2005 ACM SIGCOMM workshop on Mining network data
table of contents
Philadelphia, Pennsylvania, USA
SESSION: Security and network problem determination
table of contents
Pages: 179 - 184
Year of Publication: 2005
ISBN:1-59593-026-4
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 11, Downloads (12 Months): 53, Citation Count: 1
|
|
|
ABSTRACT
Increasingly powerful fault management systems are required to ensure robustness and quality of service in today's networks. In this context, event correlation is of prime importance to extract meaningful information from the wealth of alarm data generated by the network. Existing sequential data mining techniques address the task of identifying possible correlations in sequences of alarms. The output sequence sets, however, may contain sequences which are not plausible from the point of view of network topology constraints. This paper presents the Topographical Proximity (TP) approach which exploits topographical information embedded in alarm data in order to address this lack of plausibility in mined sequences. An evaluation of the quality of mined sequences is presented and discussed. Results show an improvement in overall system performance for imposing proximity constraints.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
3GPP. 3rd generation partnership project technical specification group services and system aspects. Telecommunication management. Fault Management. Part 2: Alarm Integration Reference Point (IRP), Information Service (IS), (Release 6) 3GPP TS 32.111-2 V6.3.0, 3GPP, 2004.
|
 |
2
|
Rakesh Agrawal , Tomasz Imieliński , Arun Swami, Mining association rules between sets of items in large databases, Proceedings of the 1993 ACM SIGMOD international conference on Management of data, p.207-216, May 25-28, 1993, Washington, D.C., United States
|
| |
3
|
R. Gopal. Layered model for supporting fault isolation and recovery. In Proc. of NOMS'00, Hawaii, 2000.
|
| |
4
|
|
| |
5
|
E. O. Heierman, G. M. Youngblood, and D. J. Cook. Mining temporal sequences to discover interesting patterns. In Proceedings of KDD 2004, Workshop on mining temporal and sequential data, 2004.
|
| |
6
|
G. Liu, A. K. Mok, and E. J. Yang. Composite events for network event correlation. In IM'99, pages 247--260, 1999.
|
| |
7
|
|
| |
8
|
D. M. Meira and J. M. S. Nogueira. Modelling a telecommunication network for fault management applications. In Proc. of NOMS'98, pages 723--732, 1998.
|
| |
9
|
|
| |
10
|
M. Steinder and A. S. Sethi. Non-deterministic diagnosis of end-to-end service failures in a multi-layer communication system. In Proc. of ICCCN'01, pages 374--379, Arizona, 2001.
|
| |
11
|
R. Sterritt. Discovering rules for fault management. In Proc. of ECBS'01, pages 190--196, 2001.
|
| |
12
|
|
| |
13
|
H. Wietgrefe, K.-D. Tuchs, K. Jobmann, G. Carls, P. Frohlich, W. Nejdl, and S. Steinfeld. Using neural networks for alarm correlation in cellular phone networks. In Proc. of IWANNT 1997, 1997.
|
| |
14
|
S. A. Yemini, S. Kliger, E. Mozes, Y. Yemini, and D. Ohsie. High speed and robust event correlation. IEEE Communications Magazine, 34(5):82--90, 1996.
|
| |
15
|
|
|