Mining Approximate Frequent Closed Flows over Packet Streams

Imen Brahmi 1 Sadok Ben Yahia 1 Pascal Poncelet 2
2 TATOO - Fouille de données environnementales
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Due to the varying and dynamic characteristics of network traffic, the analysis of traffic flows is of paramount importance for network security, accounting and traffic engineering. The problem of extracting knowledge from the traffic flows is known as the heavy-hitter issue. In this context, the main challenge consists in mining the traffic flows with high accuracy and limited memory consumption. In the aim of improving the accuracy of heavy-hitters identification while having a reasonable memory usage, we introduce a novel algorithm called ACL- Stream. The latter mines the approximate closed frequent patterns over a stream of packets. Carried out experiments showed that our proposed algorithm presents better performances compared to those of the pioneer known algorithms for heavy-hitters extraction over real network traffic traces.
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00798308
Contributor : Pascal Poncelet <>
Submitted on : Friday, March 22, 2019 - 10:16:12 AM
Last modification on : Friday, March 22, 2019 - 10:33:32 AM
Long-term archiving on : Sunday, June 23, 2019 - 1:32:01 PM

File

Dawak2011.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Imen Brahmi, Sadok Ben Yahia, Pascal Poncelet. Mining Approximate Frequent Closed Flows over Packet Streams. DaWaK: Data Warehousing and Knowledge Discovery, Aug 2011, Toulouse, France. pp.419-431, ⟨10.1007/978-3-642-23544-3_32⟩. ⟨lirmm-00798308⟩

Share

Metrics

Record views

198

Files downloads

42