Network traffic classification using decision tree based on minimum partition distance
Before data communications,every application protocol to handshake at application layer and transmit some parameters.This process is quite different according to the protocols,such as the packet direction,payload size and the information entropy of each packet payload.So according to these features,...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2012-03-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)03-0090-13/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539898317733888 |
|---|---|
| author | Zhe YANG Ling-zhi LI Qi-jin JI Yan-qin ZHU |
| author_facet | Zhe YANG Ling-zhi LI Qi-jin JI Yan-qin ZHU |
| author_sort | Zhe YANG |
| collection | DOAJ |
| description | Before data communications,every application protocol to handshake at application layer and transmit some parameters.This process is quite different according to the protocols,such as the packet direction,payload size and the information entropy of each packet payload.So according to these features,decision tree algorithm based on minimum partition distance was used to train the classifier.The results of the offline experiments on real network traces and the online classification experiments in campus network indicate that,analyzing the first four or six packets of each flow is enough to classify eight common used application protocols with high overall accuracy and low cost.Contrast to other machine learning algorithms,decision tree can achieve better ent traces and low classification time.So it is very suitable for real-time traffic classification. |
| format | Article |
| id | doaj-art-3d6b7d349ccd452c98f6842e52d5f359 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2012-03-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-3d6b7d349ccd452c98f6842e52d5f3592025-01-14T06:31:25ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2012-03-01339110259660817Network traffic classification using decision tree based on minimum partition distanceZhe YANGLing-zhi LIQi-jin JIYan-qin ZHUBefore data communications,every application protocol to handshake at application layer and transmit some parameters.This process is quite different according to the protocols,such as the packet direction,payload size and the information entropy of each packet payload.So according to these features,decision tree algorithm based on minimum partition distance was used to train the classifier.The results of the offline experiments on real network traces and the online classification experiments in campus network indicate that,analyzing the first four or six packets of each flow is enough to classify eight common used application protocols with high overall accuracy and low cost.Contrast to other machine learning algorithms,decision tree can achieve better ent traces and low classification time.So it is very suitable for real-time traffic classification.http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)03-0090-13/traffic classificationbidirectional flowminimum partition distancedecision tree |
| spellingShingle | Zhe YANG Ling-zhi LI Qi-jin JI Yan-qin ZHU Network traffic classification using decision tree based on minimum partition distance Tongxin xuebao traffic classification bidirectional flow minimum partition distance decision tree |
| title | Network traffic classification using decision tree based on minimum partition distance |
| title_full | Network traffic classification using decision tree based on minimum partition distance |
| title_fullStr | Network traffic classification using decision tree based on minimum partition distance |
| title_full_unstemmed | Network traffic classification using decision tree based on minimum partition distance |
| title_short | Network traffic classification using decision tree based on minimum partition distance |
| title_sort | network traffic classification using decision tree based on minimum partition distance |
| topic | traffic classification bidirectional flow minimum partition distance decision tree |
| url | http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)03-0090-13/ |
| work_keys_str_mv | AT zheyang networktrafficclassificationusingdecisiontreebasedonminimumpartitiondistance AT lingzhili networktrafficclassificationusingdecisiontreebasedonminimumpartitiondistance AT qijinji networktrafficclassificationusingdecisiontreebasedonminimumpartitiondistance AT yanqinzhu networktrafficclassificationusingdecisiontreebasedonminimumpartitiondistance |