Maximizing Efficiency: Relocation and Deduplication for Result Caching in Distributed and Collaborative Edge Computing Networks
Bibliographic record
Abstract
With the rapid growth of internet of things (IoT) devices, edge computing has emerged as a crucial technology for delivering low-latency and resource-efficient services. However, the surge in edge computing capabilities poses challenges in efficiently managing result caching and deduplication to effectively utilize storage and processing resources. This study introduces a novel approach that harnesses an adaptive enhanced initiation genetic algorithm (AEIGA) for result deduplication/relocation in collaborative and distributed edge computing networks, with the goal of enhancing task offloading and result delivery. Our work proposes an optimization framework that integrates deduplication/relocation strategies to minimize redundancy, improve latency, and optimize storage across edge servers. The proposed AEIGA addresses the NP-hard nature of the formulated optimization problem by efficiently exploring the vast solution space to find optimal or near-optimal solutions. Simulation results demonstrate significant improvements of the proposed AEIGA in various network performance metrics. Our findings highlight the effectiveness of employing AEIGA for result deduplication/relocation in edge computing, offering a scalable solution to meet the escalating demands of IoT networks.
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.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 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".