Distributed and scalable event correlation based on causality graph

Authors:
Nan Guo;Tianhan Gao;Bin Zhang;Hong Zhao
Affiliations:
Information Science and Engineering College, Northeastern University, China;Information Science and Engineering College, Northeastern University, China;Information Science and Engineering College, Northeastern University, China;Information Science and Engineering College, Northeastern University, China
Venue:
APNOMS'07 Proceedings of the 10th Asia-Pacific conference on Network Operations and Management Symposium: managing next generation networks and services
Year:
2007

Citing 5
Cited 0

Coding-based schemes for fault identification in communication networks

International Journal of Network Management
Network Management: An Introduction to Principles and Practice

Network Management: An Introduction to Principles and Practice
A Framework for Event Correlation in Communication Systems

MMNS '01 Proceedings of the 4th IFIP/IEEE International Conference on Management of Multimedia Networks and Services: Management of Multimedia on the Internet
Preprocessor Algorithm for Network Management Codebook

Proceedings of the Workshop on Intrusion Detection and Network Monitoring
High speed and robust event correlation

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

The traditional centralized event correlations are less of simplicity, scalability and robustness. DSEC is presented to solve this problem. It is based on the Divide-and-Conquer strategy that makes parallel local correlation at multiple agents and combines local causes on the global level. It regards a management task as an event probe, thus brings high-level and rich-semantic information to events and achieves the simplicity and scalability of causality graph. Meanwhile, it limits event explosion at each agent and improves robustness to noise.