The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Traffic classification through simple statistical fingerprinting
Abstract
The classification of IP ows according to the application that generated them is at the basis of any modern network management platform. However, classical techniques such as the ones based on the analysis of transport layer or application layer information are rapidly becoming ineffective. In this paper we present a ow classification mechanism based on three simple properties of the captured IP packets: their size, inter-arrival time and arrival order. Even though these quantities have already been used in the past to define classification techniques, our contribution is based on new structures called protocol fingerprints, which express such quantities in a compact and efficient way, and on a simple classification algorithm based on normalized thresholds. Although at a very early stage of development, the proposed technique is showing promising preliminary results from the classification of a reduced set of protocols.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Wide area traffic: the failure of Poisson modeling
Paxson, V., & Floyd, S. (1995) · IEEE/ACM Transactions on Networking · doi:10.1109/90.392383 · Cited by 3,708
Snort - Lightweight Intrusion Detection for Networks
Roesch, M. (1999) · Cited by 3,163
Bro: a system for detecting network intruders in real-time
Paxson, V. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00112-7 · Cited by 2,636
Internet traffic classification using bayesian analysis techniques
Moore, A. W., & Zuev, D. (2005) · Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/1064212.1064220 · Cited by 1,208
BLINC: multilevel traffic classification in the dark
Karagiannis, T., Papagiannaki, K., & Faloutsos, M. (2005) · Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1080091.1080119 · Cited by 997
Toward the Accurate Identification of Network Applications
Moore, A. W., & Papagiannaki, K. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31966-5_4 · Cited by 801 · cited 2×
“[13] also try to identify classes of traffic, instead of focusing on the classification of specific application layer protocols.”
BackgroundMethodEmpirically derived analytic models of wide-area TCP connections
Paxson, V. (1994) · IEEE/ACM Transactions on Networking · doi:10.1109/90.330413 · Cited by 581
Flow Clustering Using Machine Learning Techniques
McGregor, A., Hall, M., Lorier, P., & Brunskill, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24668-8_21 · Cited by 521
Roughan, M., Sen, S., Spatscheck, O., & Duffield, N. (2004) · Proceedings of the 4th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1028788.1028805 · Cited by 494
Computing Science and Statistics
(1992) · Springer eBooks · doi:10.1007/978-1-4612-2856-1 · Cited by 449
Early application identification
Bernaille, L., Teixeira, R., & Salamatian, K. (2006) · Proceedings of the 2006 ACM CoNEXT conference on - CoNEXT '06 · doi:10.1145/1368436.1368445 · Cited by 374 · cited 2×
“[14] proposes the use of three clustering techniques to achieve fine-grained classification based on size and direction of packets.”
BackgroundMethodAn analysis of Internet chat systems
Dewes, C., Wichmann, A., & Feldmann, A. (2003) · ACM Internet Measurement Conference (IMC) · doi:10.1145/948205.948214 · Cited by 154
The CoralReef Software Suite as a Tool for System and Network Administrators
Moore, D., Keys, K., Koga, R., Lagache, E., & claffy, K. (2001) · Cited by 114
Statistical Clustering of Internet Communication Patterns
Hernández-Campos, F., Smith, F. D., Kevin Jeffay, B., & Nobel, A. B. (2003) · Cited by 56
Cited by
A survey of techniques for internet traffic classification using machine learning
Nguyen, T. T. T., & Armitage, G. (2008) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2008.080406 · Cited by 1,664
“Some ( [53] and [61]) have explored the performance of ML classifiers that utilise only the first few packets of a flow, but they cannot cope with missing the flow’s initial packets.”
BackgroundDeep packet: a novel approach for encrypted traffic classification using deep learning
Lotfollahi, M., Jafari Siavoshani, M., Shirali Hossein Zade, R., & Saberian, M. (2020) · Soft Computing · doi:10.1007/s00500-019-04030-2 · Cited by 1,190
Deep Learning for Intelligent Wireless Networks: A Comprehensive Survey
Mao, Q., Hu, F., & Hao, Q. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2846401 · Cited by 789
Internet traffic classification demystified: myths, caveats, and the best practices
Kim, H., Claffy, K., Fomenkov, M., Barman, D., Faloutsos, M., & Lee, K. (2008) · Proceedings of the 2008 ACM CoNEXT Conference on - CONEXT '08 · doi:10.1145/1544012.1544023 · Cited by 485
Robust Network Traffic Classification
Zhang, J., Chen, X., Xiang, Y., Zhou, W., & Wu, J. (2015) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2014.2320577 · Cited by 391
Metadata
- Authors
- Crotti, M., Dusi, M., Gringoli, F., & Salgarelli, L.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2007-01-22
- Volume
- 37
- Issue
- 1
- Pages
- 5-16
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2157349061
- Cited by
- 396
- References
- 14
- FWCI
- 47.67
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.