Deep reinforcement learning-based intrusion detection scheme for software-defined networking
Bibliographic record
Abstract
A robust Deep Reinforcement Learning-based Intrusion Detection Scheme (DRL-IDS) for Software-Defined Networking (SDN) which combines the Long-Short Term Sequence Recurrent Neural Network (LFTS-RNN) with the Particle Cloud-Integrated Joint Time- and Feature-Optimization Algorithm (PC-JTFOA). The hybrid model aims to enhance the security of SDN through the detection and mitigation of a wide array of Distributed Denial of Service attacks and network misbehaviors across different SDN planes. The LFTS-RNN is used for accurate attack detection and misbehavior identification. Meanwhile, the PC-JTFOA optimizes feature selection, load balancing, and energy-efficient routing, thus ensuring fast and reliable network traffic management. The deep reinforcement learning approach further enables continuous adaptation to changing network behaviors, thus making the model dynamically adapt to known as well as emerging attack vectors. The proposed DRL-IDS scheme obtains superior performance in experimental results based on the NSL-KDD and WPPD datasets. The LFTS-RNN model indicates a highly impressive sensitivity of 98.67% and specificity of 97.42%, while the DRL-IDS model presents an detection accuracy of 99.85%. The PC-JTFOA further improves the solution by exhibiting a low response time of 1423 ms, which indicates tremendous improvement in computational efficiency. A comparative analysis with the existent intrusion detection methods pointed out that the scheme proposed not only outperforms other models in terms of detection accuracy as well as adaptability, but it also reduces complexity.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".