AI-Based E2E Resilient and Proactive Resource Management in Slice-Enabled 6G Networks
Bibliographic record
Abstract
Intelligence and flexibility are the two main requirements for next-generation networks that can be implemented in network slicing (NetS) technology. This intelligence and flexibility can have different indicators in networks, such as proactivity and resilience. In this paper, we propose a novel proactive end-to-end (E2E) resource management in a packet-based model, supporting NetS. Since guaranteeing quality of service (QoS) in NetS has many challenges, we present an intelligent method that has two characteristics: resilience and proactivity. Guaranteeing successful slice provision is costly, we formulate a comprehensive model of the imposed costs. To minimize the cost function, we introduce a new optimization problem with radio, processing, and transmission resource constraints. In addition, we introduce two new constraints that guarantee the proactivity and resilience capabilities of the network based on the probability of successful slice provisioning (PSSP). Since the proposed optimization problem is non-convex, online and belongs to the NP-hard category, we adopt a deep reinforcement learning (DRL) based method to solve it. In particular, the soft actor critic (SAC) method is utilized due to its robustness in uncertain environment that the obtained results reveal that the applied method can improve the percentage of successful slice provisioned (PrSSP). In addition, the resiliency time is reduced comparatively. Finally, as the main achievement, the resilient scenario improves PrSSP compared to the non-resilient scenario.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".