Cited by 630Internet Traffic Analysis and Secure E-votingSoftware-Defined Networks and 5GNetwork Packet Processing and Optimization

The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.

Issues and future directions in traffic classification

Dainotti, Alberto, Pescape, Antonio, Claffy, Kimberly·2012·IEEE Network

Abstract

Traffic classification technology has increased in relevance this decade, as it is now used in the definition and implementation of mechanisms for service differentiation, network design and engineering, security, accounting, advertising, and research. Over the past 10 years the research community and the networking industry have investigated, proposed and developed several classification approaches. While traffic classification techniques are improving in accuracy and efficiency, the continued proliferation of different Internet application behaviors, in addition to growing incentives to disguise some applications to avoid filtering or blocking, are among the reasons that traffic classification remains one of many open problems in Internet research. In this article we review recent achievements and discuss future directions in traffic classification, along with their trade-offs in applicability, reliability, and privacy. We outline the persistently unsolved challenges in the field over the last decade, and suggest several strategies for tackling these challenges to promote progress in the science of Internet traffic classification.

Overview

Integrity signals

Registry

Crossref · 10.1109/mnet.2012.6135854

Cites

16 of 16 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Research works printed but not linked: 1

  1. karagiannis, 0, BLlNC: Multilevel Traffic Classification in the Dark, Proc 2005 Conf Apps Technologies Architectures and Protocols for Comp Commun ACM SIGCOMM '05, 229

Cited by

Sorted by citations

See all 630

Metadata

Authors
Dainotti, A., Pescape, A., & Claffy, K.
Affiliations
University of Naples Federico II (IT)
Venue
IEEE Network
Published
2012-01
Volume
26
Issue
1
Pages
35-40
ISSN
0890-8044 (ISSN-L)
OpenAlex
W2149600645
Cited by
630
References
16
Citations by year
2026: 24 · 2025: 41 · 2024: 43 · 2023: 46 · 2022: 65 · 2021: 48 · 2020: 54 · 2019: 43 · 2018: 43 · 2017: 34 · 2016: 47 · 2015: 44 · 2014: 46 · 2013: 39 · 2012: 12
FWCI
44.40
Type
journal article
Language
en
Open access
closed
Locations
IEEE Network (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
  • Physical Sciences › Computer Science › Computer Networks and Communications › Software-Defined Networks and 5G
  • Physical Sciences › Computer Science › Hardware and Architecture › Network Packet Processing and Optimization
Keywords
network traffic classification, Internet traffic, privacy, service differentiation, network security, network accounting

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