RUS  ENG
Full version
JOURNALS // Informatics and Automation // Archive

Tr. SPIIRAN, 2015 Issue 40, Pages 110–121 (Mi trspy806)

This article is cited in 1 paper

Application of Binary Trees for the IDS Events Aggregation Task

R. R. Fatkieva, D. K. Levonevskiy

St. Petersburg Institute for Informatics and Automation of Russian Academy of Sciences (SPIIRAS)

Abstract: This paper considers the problem of a choice of algorithms and data structures to achieve the effective processing of events generated by intrusion detection systems. The proposed approach is based on balanced binary trees and speeds up the operations of adding and searching records in the structure. The paper provides the theoretical and experimental confirmation of the efficiency of the developed approach.

Keywords: information security; data structures; intrusion detection systems; network traffic; network anomalies.

UDC: 004.7

DOI: 10.15622/sp.40.8



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024