Latest revision as of 17:13, 21 January 2021

Abstract

International audience; 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.

Original document

The different versions of the original document can be found in:

• http://www.lirmm.fr/%7Eponcelet/publications/papers/Dawak2011.pdf

• http://link.springer.com/content/pdf/10.1007/978-3-642-23544-3_32,

http://dx.doi.org/10.1007/978-3-642-23544-3_32 under the license http://www.springer.com/tdm

• https://hal-lirmm.ccsd.cnrs.fr/lirmm-00798308,

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00798308/document,

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00798308/file/Dawak2011.pdf

• https://link.springer.com/chapter/10.1007/978-3-642-23544-3_32,

https://www.scipedia.com/public/Brahmi_et_al_2011a,

https://dblp.uni-trier.de/db/conf/dawak/dawak2011.html#BrahmiYP11,

https://www.researchgate.net/profile/Pascal_Poncelet/publication/220802350_Mining_Approximate_Frequent_Closed_Flows_over_Packet_Streams/links/0f31752ed217a82b69000000.pdf,

https://rd.springer.com/chapter/10.1007/978-3-642-23544-3_32,

https://academic.microsoft.com/#/detail/21047492