Community Detection-Empowered Self-Adaptive Network Slicing in Multi-Tier Edge-Cloud System
Bibliographic record
Abstract
Network slicing (NS) is a highly promising paradigm in 5G and forthcoming 6G communication networks. NS allows for the customization of multiple logically independent network slices to provide tailored service for vertical applications with diverse quality of service (QoS) requirements. However, current research on NS primarily relies on the traditional modeling methods such as service function chaining (SFC) and task offloading, which have limitations in adapting to the evolving scenarios in 5G/6G networks. To address this, our study introduces one novel Self-adaptive Network Slicing (SNS) modeling method. In this approach, each service is abstracted as multiple SFC replicas originating from diverse access points. Based on the SNS modeling, we investigate a VNF configuration and flow routing (VCFR) problem for service provisioning in a multi-tier system. With the objective of achieving load-balancing with minimal slice operational expenditure, we formulate the VCFR as a mixed-integer linear programming. However, deriving an exact solution via MILP is computationally expensive due to its NP-hardness. To reduce computational complexity, we propose one Load Balancing-considered Community Detection-based Heuristic (LBCD-Heu), our divide and conquer approach, to solve the problem. In LBCD-Heu, we first design a load balancing-considered community detection method to divide the substrate multi-tier network into multiple independent communities. Following this, the MILP is employed in each community to obtain a near-optimal solution. Extensive evaluations justify that LBCD-Heu can effectively reduce the service operational cost and algorithm run-time while ensuring the load balancing of substrate network. Additionally, our results verify that the SNS modeling enables the provision of services at lower expenditures compared with traditional modeling methods.
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.001 | 0.000 |
| Bibliometrics | 0.000 | 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".