Security Risk-Aware Resource Management Mechanism for the 5G Cloudified Infrastructure
Bibliographic record
Abstract
5G wireless networks will play a critical role in society by providing ubiquitous access to end users, supporting mission critical applications, and interconnecting other critical infrastructure systems. Given its criticality, cybersecurity should be taken by design to ensure the security of running services and compliance with Service Level Agreements (SLA). This Thesis addresses the problem of security-aware resource allocation of the 5G cloudfied infrastructure aiming at minimizing the security risks while maximizing the dependability. To this end, a risk-aware edge-cloud mechanism in addition to three stochastic optimal controllers are proposed to efficiently manage the cloudified infrastructure to ensure the protection of services and applications as well as the protection of the infrastructure against cyber threats such as resource exhaustion due to flash network traffic, DoS attack, and SLA violations. To ensure a secure and SLA compliant operation of the cloudified 5G infrastructure, new and innovative cost structures are proposed to guide the optimal controllers towards a safe and sustainable operation where it is shown that they offset the cost of operationalizing the cloudified infrastructure by offering economical benefits related to the provisioning of secure and reliable services. Furthermore, we propose new security and dependability metrics that allows for the quantification of the perceived security risk of services, the probability of SLA violation, the probability of edge placement, the probability of cloud placement and the probability of a DoS attack. Considering the risk-awareness of the proposed mechanisms, they can be successfully integrated into the proposed agile security framework, which is based on an offensive posture that allows for a rapid response to cyber threats that might endanger the operations of the cloudified 5G infrastructure. Last but not least, this Thesis emphasizes the application of stochastic process and stochastic optimization which are essential tools to capture the uncertainties in dealing with the security aspects of the massive infrastructure, the demand and workload characterization.
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.001 | 0.002 |
| 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.002 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".