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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggrawal, C.C.: Data Streams: Models and Algorithms. Springer, Heidelberg (2007)
Barakat, C., Iannaccone, G., Diot, C.: Ranking Flows From Sampled Traffic. In: Proceedings of the 2005 ACM Conference on Emerging Network Experiment and Technology, Toulouse, France, pp. 188–199 (2005)
Bhattacharyya, S., Madeira, A., Muthukrishnan, S., Ye, T.: How To Scalably and Accurately Skip Past Streams. In: Proceedings of the IEEE 23rd International Conference on Data Engineeringg, Istanbul, Turkey, pp. 654–663 (2007)
Bu, T., Cao, J., Chen, A., Lee, P.P.C.: Sequential Hashing: A Flexible Approach for Unveiling Significant Patterns in High Speed Networks. Computer Network 54(18), 3309–3326 (2010)
Cormode, G., Muthukrishnan, S.: An Improved Data Stream Summary: The Count-Min Sketch and its Applications. Journal of Algorithms 55(1), 58–75 (2005)
Demaine, E.D., López-Ortiz, A., Munro, J.I.: Frequency Estimation of Internet Packet Streams with Limited Space. In: Proceedings of the 10th Annual European Symposium on Algorithms, Rome, Italy, pp. 348–360 (2002)
Dimitropoulos, X., Hurley, P., Kind, A.: Probabilistic Lossy Counting: An Efficient Algorithm for Finding Heavy-hitters. ACM SIGCOMM Computer Communications Review 38(1), 5–5 (2008)
Duffeld, N., Lund, C., Thorup, M.: Flow Sampling Under Hard Resource Constraints. In: Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems, pp. 85–96. ACM Press, New York (2004)
Kamiyama, N., Mori, T.: Simple and Accurate Identification of High-rate Flows by Packet Sampling. In: Proceedings of the 25th IEEE International Conference on Computer Communications, Barcelona, Spain, pp. 2836–2848 (2006)
Kodialam, M., Lakshman, T.V., Monhanty, S.: Runs Based Traffic Estimator (RATE): A Simple, Memory Efficient Scheme for Per-Flow Rate Estimation. In: Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies, Hong Kong, China, pp. 1808–1818 (2004)
Li, X., Deng, Z.H.: Mining Frequent Patterns from Network Flows for Monitoring Network. Expert System with Applications 37(12), 8850–8860 (2010)
Manku, G.S., Motwani, R.: Approximate Frequency Counts over Data Streams. In: Proceedings of the 28th International Conference on Very Large Data Bases, Hong Kong, China, pp. 346–357 (2002)
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398–416. Springer, Heidelberg (1998)
Rong, Q., Zhang, G., Xie, G., Salamatian, K.: Mnemonic Lossy Counting: An Efficient and Accurate Heavy-hitters Identification Algorithm. In: Proceedings of the 29th IEEE International Performance Computing and Communications Conference, Albuquerque, United States (2010)
Zhang, Y., Fang, B.X., Zhang, Y.Z.: Identifying Heavy-hitters in High-speed Network Monitoring. Science 53(3), 659–676 (2010)
Zhang, Z., Wang, B., Chen, S., Zhu, K.: Mining Frequent Flows Based on Adaptive Threshold with a Sliding Window over Online Packet Stream. In: Proceedings of the International Conference on Communication Software and Networks, Macau, China, pp. 210–214 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brahmi, I., Ben Yahia, S., Poncelet, P. (2011). Mining Approximate Frequent Closed Flows over Packet Streams. In: Cuzzocrea, A., Dayal, U. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2011. Lecture Notes in Computer Science, vol 6862. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23544-3_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-23544-3_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23543-6
Online ISBN: 978-3-642-23544-3
eBook Packages: Computer ScienceComputer Science (R0)