High-Performance Internet Traffic Classification Using a Markov Model and Kullback-Leibler Divergence

11Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

As internet traffic rapidly increases, fast and accurate network classification is becoming essential for high quality of service control and early detection of network traffic abnormalities. Machine learning techniques based on statistical features of packet flows have recently become popular for network classification partly because of the limitations of traditional port-and payload-based methods. In this paper, we propose a Markov model-based network classification with a Kullback-Leibler divergence criterion. Our study is mainly focused on hard-to-classify (or overlapping) traffic patterns of network applications, which current techniques have difficulty dealing with. The results of simulations conducted using our proposed method indicate that the overall accuracy reaches around 90% with a reasonable group size of n=100.

Cite

CITATION STYLE

APA

Kim, J., Hwang, J., & Kim, K. (2016). High-Performance Internet Traffic Classification Using a Markov Model and Kullback-Leibler Divergence. Mobile Information Systems, 2016. https://doi.org/10.1155/2016/6180527

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free