Resilience and Recovery Mechanisms for Software-Defined Networking (SDN) and Cloud Networks
Bibliographic record
Abstract
This research examines the vulnerabilities and resilience mechanisms of Software-Defined Networking (SDN) and cloud networks, with a specific focus on controller failures and security attacks. The study leverages both simulated and real-world data to assess how these vulnerabilities impact network performance metrics including downtime, packet loss, latency, and throughput. A significant observation from the study is that the nature and impact of network disruptions vary significantly depending on the type of failure or attack, highlighting the need for tailored resilience strategies. Machine learning techniques, notably Support Vector Machines (SVMs), are employed to classify these disruptions with high accuracy, suggesting a promising direction for proactive network management. The research proposes a novel framework that combines the dynamic control capabilities of SDN with machine learning and automation to improve the networks’ fault tolerance and recovery mechanisms. The effectiveness of this framework is demonstrated through enhanced resilience and reduced performance degradation during network disruptions. This study contributes to the field by outlining a scalable and efficient approach to mitigating vulnerabilities in SDN and cloud networks, thereby enhancing overall network stability and reliability.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| 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".