Detailed Information

Cited 2 time in webofscience Cited 5 time in scopus
Metadata Downloads

Session-based classification of internet applications in 3G wireless networks

Authors
Lee, SeongjinSong, JongwooAhn, SoohanWon, Youjip
Issue Date
Dec-2011
Publisher
Elsevier BV
Keywords
Traffic classification; CART; SVM; Clustering; HSDPA
Citation
Computer Networks, v.55, no.17, pp 3915 - 3931
Pages
17
Indexed
SCIE
SCOPUS
Journal Title
Computer Networks
Volume
55
Number
17
Start Page
3915
End Page
3931
URI
https://scholarworks.gnu.ac.kr/handle/sw.gnu/73965
DOI
10.1016/j.comnet.2011.08.010
ISSN
1389-1286
1872-7069
Abstract
Accurately classifying and identifying wireless network traffic associated with various applications, such as Web, VoIP, and VoD, is a challenge for both service providers and network operators. Traditional classification schemes exploiting port or payload analysis are becoming ineffective in actual networks, as many new applications are emerging. This paper presents the classification of HSDPA network traffic applications using Classification and Regression Tree (CART) and Support Vector Machine (SVM) with the session information as a basic measure. The session is bidirectional traffic stream between two hosts that is used as a basic measure and a unit of information. We acquired and processed HSDPA traffic from a real 3G network without sanitizing the data. CART and SVM are used to classify six application groups (download, game, upload, VoD, VoiP, and web) with a set of twelve easily retrievable features. These features are composed of simple statistical pieces of information, such as the standard deviation of the packet sizes, the number of packets, and the duration of a session. Compared to results of a flow-based application classification, session-based classification produces 11.07% (CART) and 21.99% (SVM) increases in the true positive rate. This feature set is further reduced to two principal components using Principal Component Regression. This paper also takes the initiative to compare CART to K-Means, the wired network traffic clustering scheme, and shows that CART is more accurate for classification than is K-Means. (C) 2011 Elsevier B.V. All rights reserved.
Files in This Item
There are no files associated with this item.
Appears in
Collections
ETC > Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher Lee, Seong Jin photo

Lee, Seong Jin
IT공과대학 (소프트웨어공학과)
Read more

Altmetrics

Total Views & Downloads

BROWSE