(Created page with " == Abstract == International audience Due to the varying and dynamic characteristics of network traffic, the analysis of traffic flows is of paramount importance for net- w...") |
m (Scipediacontent moved page Draft Content 620679403 to Brahmi et al 2011a) |
(No difference)
| |
Revision as of 14:25, 14 October 2020
Abstract
International audience Due to the varying and dynamic characteristics of network traffic, the analysis of traffic flows is of paramount importance for net- work security, accounting and traffic engineering. The problem of ex- tracting 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: Part of book or chapter of book
Full document
Original document
The different versions of the original document can be found in:
Document information
Published on 01/01/2011
Volume 2011, 2011
DOI: 10.1007/978-3-642-23544-3_32
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?