Distributed detection of DDoS attack on 5G network slices using federated learning
Bibliographic record
Abstract
The advent of 5G networks has revolutionized telecommunications by enabling flexible and efficient service deployment through network slicing. These slices ensure logical isolation among various services, facilitating tailored Quality of Service (QoS) and security policies. However, while network slicing enhances service differentiation, it also increases architectural complexity and broadens the attack surface, making slices more susceptible to cyber threats specifically Distributed Denial-of-Service (DDoS) attacks. Furthermore, the rapid proliferation of connected devices in 5G networks, driven by diverse service offerings, exacerbates security risks. Due to the growing attack landscape, Machine Learning (ML) based Intrusion Detection Systems (IDS) are getting popular over traditional IDS. Since network slices are used by different verticals, they often have strict privacy requirements. Conventional ML-based IDS are centralized in nature, combining all data on a central server, which fails to uphold slice-level privacy constraints This thesis presents FLAccShield, a Federated Learning (FL)-based privacy preserving IDS framework for DDoS detection in 5G networks through collaboration among multiple slices. This distributed approach enables model training across slices while ensuring that data remains local, thereby preserving privacy and minimizing network overhead. The framework is rigorously evaluated for supervised and unsupervised settings for both Independent and Identically Distributed (IID) and non- IID datasets against a varied range of features against three baseline FL strategies: FedAvg, FedProx, and QFedAvg. We also compared FLAccShield’s performance against slice-wise Independent Local Training. The experimental results demonstrate that FLAccShield achieves F1-scores up to 32% higher than traditional aggregation method for FL such as FedAvg and 5% higher than Local Training in supervised settings with IID data. In unsupervised settings, it outperforms state-of-the-art FL methods such as FedAvg, FedProx, and QFedAvg by 0.4%, 1%, and 32%, respectively. Under non-IID conditions, FLAccShield improves by 3% over FedAvg and FedProx, and 2% over QFedAvg, respectively. These findings highlight FLAccShield’s robustness, efficiency, and its ability to preserve privacy in complex 5G environments.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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 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".