GAI-Based Resource and QoE Aware Service Placement in Next-Generation Multi-Domain IoT Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Network Function Virtualization (NFV) has recently emerged as a highly cost-effective paradigm for flexibly provisioning services in next-generation Internet of Things (IoT) networks, by introducing Service Function Chain (SFC) technology. However, the rapid expansion of network scales and increasing diversification of service requirements in recent years pose significant challenges to ensuring the Quality of Experience (QoE) of users in Next-generation Multi-domain IoT (NMIoT) networks. The effective deployment of SFCs in NMIoT networks to satisfy diversified resource demands while enhancing QoE of users is crucial. The recent breakthroughs in Generative Artificial Intelligence (GAI) technologies bring a new opportunity to deliver customized services and guarantee enhanced service quality in NMIoT networks. To tackle the challenges, in this paper, we investigate the problem of Resource and QoE aware SFC Placement (RQSP) in NMIoT networks. Firstly, we formulate the RQSP problem as a mixed integer linear programming model, taking into account resource demands and Quality of Service (QoS) constraints, aiming to minimize the service cost, which is composed of resource consumption cost, cross-domain operational cost and penalty cost for unsuccessful placement. Then, we prove that the RQSP problem is NP-hard. To solve it, we incorporate GAI technology to devise a novel Generative genetic Algorithm based heuristic SFC Placement (GAP) method. Furthermore, we devise a greedy strategy based population initialization mechanism as well as an elitist and roulette wheel joint selection strategy, to speed up algorithm convergence and reduce runtime overhead. Finally, simulation results demonstrate that compared to benchmark algorithms, the proposed GAP algorithm can achieve better performances on service acceptance ratio, service cost, server utilization and average service delay.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 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 it