Co-Operative and Hybrid Replacement Caching for Multi-Access Mobile Edge Computing
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
Multi-Access Mobile Edge Computing (MEC) is proclaimed as a key technology for reducing service processing delays in 5G networks. Caching on MEC will decrease service latency and improve data access by allowing direct content delivery through the edge without fetching content from the remote server, Caching on MEC is also deemed as an effective approach that guarantees more reachability due to proximity to end-users. This paper proposes a novel hybrid content caching replacement algorithm in MEC to increase its caching efficiency where future request references are predicted using a polynomial fit algorithm along with Lagrange interpolation. Additionally, a distributed co-operative caching algorithm to improve data access within MECs. Experimental results have shown that the proposed scheme obtains more cache hits and lesser average CPU utilization due to its selective caching approach when compared with existing traditional cache replacement algorithms.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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