Robust and Reliable SFC Placement in Resource-Constrained Multi-Tenant MEC-Enabled Networks
Bibliographic record
Abstract
With the rapid development and incoming implementation of 5G networks, many use cases, such as Intelligent Transportation Systems (ITS), are being realized. Utilizing networking technologies, including Network Function Virtualization and Mobile Edge Computing, along with 5G network slicing, the Next-Generation Service Placement Problem (NGSPP) is gaining significant attention due to the criticality of its services and its resource-constrained network nodes. The placement of services on Next-Generation (NG) networks has inherent challenges, mainly ultra-low latency requirements and the complexity of NG network management and orchestration. A candidate solution to the NGSPP should provide a placement that adheres to the strict Quality of Service (QoS) requirements. This work presents the formulation of a robust optimization problem that optimizes the high-availability placement of applications in resource-constrained and multi-tenant NG networks, which complies with QoS requirements and is capable of protecting the performance of the solution under adverse conditions. Finally, a set of hierarchical clustering-based heuristic algorithms, which reduce the time-complexity of the solution are proposed. Results demonstrate that formulating the robust solution is a proactive method of injecting resilience into the system and can preserve performance across various levels of system uncertainty.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 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.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".