A Performance and Reliability-Guaranteed Predictive Approach to Service Migration Path Selection in Mobile Computing
Bibliographic record
Abstract
Mobile edge computing (MEC) is a forward-looking technology that provides services through resources to meet the needs of cloud-edge Internet of Things (IoT) devices. It provides computing and storage data facilities for IoT users and further renders services through resources in vicinity to fulfill the needs from IoT devices at the cloud edge. However, a major difficulty in guaranteeing reliable resource provisioning is mobility, which brings in chances of service migrations among difference distributed edge nodes and thus causes potential risks of service failures or disruptions. Existing solutions in this direction can be ineffective since they tend to consider that stability of inter-edge-node data transmission to be irrelevant to user mobility and are thus in lack of a comprehensive model for estimating effectiveness of migration paths selected. In this article, instead, we consider that the effectiveness of migrations paths to be selected are highly dependent on user mobility as well as inter-edge-node stability propose a novel predictive and mobile track-aware approach to fault-tolerant service migration path selection in MEC (PTSM). It is capable of exploiting uses trajectories for accurate predictions of future tracks and selecting target servers as well as migration paths with guaranteed migration reliability and performance in terms of multiple metrics. We demonstrate with extensive simulations and numerical results that our proposed method outperforms its peers in terms of migration reliability and performance.
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.000 |
| 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".