M. Sidiq, Nanda Iryani, A. Basuki, Arief Indriarto Haris, Rd. Angga Ferianda
{"title":"Feasibility Evaluation of Compact Flow Features for Real-time DDoS Attacks Classifications","authors":"M. Sidiq, Nanda Iryani, A. Basuki, Arief Indriarto Haris, Rd. Angga Ferianda","doi":"10.1109/COMNETSAT56033.2022.9994323","DOIUrl":null,"url":null,"abstract":"According to the research trend, training the distributed denial of services (DDoS) attacks classifier using network flow features will yield higher classification performances and efficiency than the per-packet-based approach. Nonetheless, the existing flow-based classifier uses bloated features and offline flow extraction that is not suitable for real-time DDoS protection. This study investigates the feasibility of compact flow features that can be directly extracted using a programmable switch for real-time DDoS attack classification. The proposed method considers only four flow features: IP protocols, packet counter, total byte counter, and the delta time of a network flow. The evaluation results on the CICDDoS2019 dataset showed a comparable classification performance to the works that use bloated features (24 - 82 features). The best result was achieved by the decision tree and the random forest classifier showing ≥ 89.5% scores in accuracy, precision, recall, and F1 score. The proposed models can classify 10 out of 12 DDoS attacks correctly, failing only to discriminate between SSDP and UDP-based DDoS attacks. In addition, the trained classifier shows a better generalization ability by retaining similar performances on unseen 42.8 millions flow data while trained on ≤ 200 thousand flow data. At last, the proposed method is suitable for real-time application since it supports quick classification performance of up to 9.6 millions of flow inferring per second on the Decision Tree classifier.","PeriodicalId":221444,"journal":{"name":"2022 IEEE International Conference on Communication, Networks and Satellite (COMNETSAT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Communication, Networks and Satellite (COMNETSAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMNETSAT56033.2022.9994323","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
According to the research trend, training the distributed denial of services (DDoS) attacks classifier using network flow features will yield higher classification performances and efficiency than the per-packet-based approach. Nonetheless, the existing flow-based classifier uses bloated features and offline flow extraction that is not suitable for real-time DDoS protection. This study investigates the feasibility of compact flow features that can be directly extracted using a programmable switch for real-time DDoS attack classification. The proposed method considers only four flow features: IP protocols, packet counter, total byte counter, and the delta time of a network flow. The evaluation results on the CICDDoS2019 dataset showed a comparable classification performance to the works that use bloated features (24 - 82 features). The best result was achieved by the decision tree and the random forest classifier showing ≥ 89.5% scores in accuracy, precision, recall, and F1 score. The proposed models can classify 10 out of 12 DDoS attacks correctly, failing only to discriminate between SSDP and UDP-based DDoS attacks. In addition, the trained classifier shows a better generalization ability by retaining similar performances on unseen 42.8 millions flow data while trained on ≤ 200 thousand flow data. At last, the proposed method is suitable for real-time application since it supports quick classification performance of up to 9.6 millions of flow inferring per second on the Decision Tree classifier.