Traffic Classification Using Clustering Algorithms (2006)
| Venue: | Proceedings of the ACM SIGCOMM Workshop on Mining Network Data (MineNet |
| Citations: | 37 - 5 self |
BibTeX
@INPROCEEDINGS{Erman06trafficclassification,
author = {Jeffrey Erman and Martin Arlitt and Anirban Mahanti},
title = {Traffic Classification Using Clustering Algorithms},
booktitle = {Proceedings of the ACM SIGCOMM Workshop on Mining Network Data (MineNet},
year = {2006}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Classification of network traffic using port-based or payload-based analysis is becoming increasingly difficult with many peer-to-peer (P2P) applications using dynamic port numbers, masquerading techniques, and encryption to avoid detection. An alternative approach is to classify traffic by exploiting the distinctive characteristics of applications when they communicate on a network. We pursue this latter approach and demonstrate how cluster analysis can be used to effectively identify groups of traffic that are similar using only transport layer statistics. Our work considers two unsupervised clustering algorithms, namely K-Means and DBSCAN, that have previously not been used for network traffic classification. We evaluate these two algorithms and compare them to the previously used AutoClass algorithm, using empirical Internet traces. The experimental results show that both K-Means and DBSCAN work very well and much more quickly then AutoClass. Our results indicate that although DBSCAN has lower accuracy compared to K-Means and AutoClass, DBSCAN produces better clusters.
