SDN-based Network Traffic Classification using Deep Reinforcement Learning
Bibliographic record
Abstract
Software-Defined Networking (SDN) has emerged as a transformative technology that revolutionizes network management and architecture by providing unparalleled flexibility and control over data traffic flows. This flexibility is increasingly crucial in managing the complex demands of modern networks, whereby efficient traffic management is essential for mitigating congestion and enhancing operational efficiency. This paper introduces a novel traffic management model that employs Deep Reinforcement Learning (DRL) to transcend the conventional limitations typically associated with routing strategies that prioritize the shortest path or make non-optimal decisions when forwarding the traffic between different peers. Our model not only reduces overall network congestion but also aims to minimize bandwidth usage and enhance routing mechanisms within SDN environments. By incorporating DRL-based load balancing mechanisms, the model intelligently redistributes traffic across multiple pathways, shifting the focus from proximity to efficiency. This strategic redistribution prioritizes routes that optimize both, transmission time and network performance, rather than merely the shortest path. Moreover, the integration of DRL allows for real-time decision-making, enabling our system to dynamically adapt to changing traffic conditions and user demands. This capability is instrumental in significantly reducing transmission times and improving the overall efficiency of traffic flow across the network. Our findings highlight the substantial benefits of integrating SDN with advanced DRL techniques, offering a pioneering perspective on traffic routing within SDN networks. We evaluated the proposed framework via simulations and the obtained results demonstrated the efficiency of our solution compared to the baseline approaches.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 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".