2010
DOI: 10.4018/jdwm.2010070103
|View full text |Cite
|
Sign up to set email alerts
|

Classification of Peer-to-Peer Traffic Using A Two-Stage Window-Based Classifier With Fast Decision Tree and IP Layer Attributes

Abstract: This paper presents a new approach using data mining techniques, and in particular a two-stage architecture, for classification of Peer-to-Peer (P2P) traffic in IP networks where in the first stage the traffic is filtered using standard port numbers and layer 4 port matching to label well-known P2P and NonP2P traffic. The labeled traffic produced in the first stage is used to train a Fast Decision Tree (FDT) classifier with high accuracy. The Unknown traffic is then applied to the FDT model which classifies th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2011
2011
2013
2013

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 19 publications
(19 reference statements)
0
1
0
Order By: Relevance
“…AdaBoost of Bagging and MultiBoost of Bagging are new combined multi-level Decision Tree Ensembles where Boosting is used after Bagging based on decision trees has been applied. They belong to the well-known and broad area of investigating multi-tier constructions of classifiers considered for instance, by Islam and Abawajy (2013), Islam, Abawajy, and Warren (2009), and Raahemi and Mumtaz (2010).…”
Section: Decision Tree Ensemblesmentioning
confidence: 99%
“…AdaBoost of Bagging and MultiBoost of Bagging are new combined multi-level Decision Tree Ensembles where Boosting is used after Bagging based on decision trees has been applied. They belong to the well-known and broad area of investigating multi-tier constructions of classifiers considered for instance, by Islam and Abawajy (2013), Islam, Abawajy, and Warren (2009), and Raahemi and Mumtaz (2010).…”
Section: Decision Tree Ensemblesmentioning
confidence: 99%
“…All the works are interested in finding frequent itemsets where the order of items is not important (Ashrafi, Taniar, & Smith, 2007;Raahemi & Mumtaz, 2010). On the other hand, a number of researchers (Laur, Symphor, Nock, & Poncelet, 2007;Ashrafi, Taniar, & Smith, 2007;Welzker, Zimmermann, & Bauckhage, 2010) focused on the problem of mining sequential subsequence over data streams where the order of items is important.…”
Section: Related Workmentioning
confidence: 99%