A DDoS Attack Detection on Cloud Framework Using Improved Features Based Machine Learning Approach
Bibliographic record
Abstract
A Denial of Service (DDoS) attack consumes the network bandwidth and computing resources of a targeted system, preventing the target system from being DDoS attacked by unauthorized users. This research work proposed a modified feature selection-based neural network for efficient DDoS attack detection. The proposed method is divided into three stages: feature selection, training, and testing. For the implementation of the proposed work using MATLAB 2020 software, MATLAB is a well-known academic as well as an industrial research software package for this work. In R2020 MATLAB, the proposed method is designed and simulated. There are different types of DDoS attacks present on the cloud internet. This research work uses the Canadian Institute of Cyber Security (CICIDS2017) data set to perform the proposed methodology. This data set was selected for classification because it consists of 80 parameters. Other than the benign traffic, as per the tools used, the flow records are labeled as 'Slowloris', 'Slowhttptest', 'Hulk', and 'Begian'. The proposed method shows good results in terms of accuracy, precision, selectivity, sensitivity, and confusion matrix (C.M.). The presented method shows an accuracy of 99% and the other parameters are discussed in the simulation and result section.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".