2013 Joint International Conference on Measurement and Modeling of Computer Systems
Date of publication
2013
Presentation's date
2013
Book of congress proceedings
SIGMETRICS 2013: Proceedings of the 2013 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems: June 17–21, 2013: Pittsburgh, PA, USA
Extracting knowledge from big network trac data is a matter of foremost importance for multiple purposes ranging from trend analysis or network troubleshooting to capacity planning or trac classication. An extremely useful approach to prole trac is to extract and display to a network administrator the multi-dimensional hierarchical heavy
hitters (HHHs) of a dataset. However, existing schemes for computing HHHs have several limitations: 1) they require signicant computational overhead; 2) they do...
Extracting knowledge from big network trac data is a matter of foremost importance for multiple purposes ranging from trend analysis or network troubleshooting to capacity planning or trac classication. An extremely useful approach to prole trac is to extract and display to a network administrator the multi-dimensional hierarchical heavy
hitters (HHHs) of a dataset. However, existing schemes for computing HHHs have several limitations: 1) they require signicant computational overhead; 2) they do not scale to high dimensional data; and 3) they are not easily extensible. In this paper, we introduce a fundamentally new approach for extracting HHHs based on generalized frequent item-set mining (FIM), which allows to process trac data much more eciently and scales to much higher dimensional data than present schemes. Based on generalized FIM, we build and evaluate a trac proling system we call FaRNet. Our comparison with AutoFocus, which is the most related tool of similar nature, shows that FaRNet is up to three orders of magnitude faster.
Extracting knowledge from big network traffic data is a matter of foremost importance for multiple purposes ranging from trend analysis or network troubleshooting to capacity planning or traffic classification. An extremely useful approach to profile traffic is to extract and display to a network administrator the multi-dimensional hierarchical heavy hitters (HHHs) of a dataset. However, existing schemes for computing HHHs have several limitations: 1) they require significant computational overhead; 2) they do not scale to high dimensional data; and 3) they are not easily extensible. In this paper, we introduce a fundamentally new approach for extracting HHHs based on generalized frequent item-set mining (FIM), which allows to process traffic data much more efficiently and scales to much higher dimensional data than present schemes. Based on generalized FIM, we build and evaluate a traffic profiling system we call FaRNet. Our comparison with AutoFocus, which is the most related tool of similar nature, shows that FaRNet is up to three orders of magnitude faster.
Citation
Paredes Oliva, Ignasi; Barlet, P.; Dimitropoulos, X. FaRNet: fast recognition of high multi-dimensional network traffic patterns. A: Joint International Conference on Measurement and Modeling of Computer Systems. "SIGMETRICS 2013: Proceedings of the 2013 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems: June 17–21, 2013: Pittsburgh, PA, USA". Pittsburgh, PA, USA: ACM, 2013, p. 355-356.
Share
