Modeling and Analysis of a Shared Edge Caching System for Connected Cars and Industrial IoT-Based Applications
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
The next revolution of industrial applications, known as smart industry or Industry 4.0, will rely on Internet of Things (IoT) to automate the monitoring, inspection, and control of industrial equipment and processes. In Industry 4.0, efficient content delivery is one of the fundamental challenges to be addressed. Nowadays, the promising solution for content delivery in smart industrial applications is the use of hierarchical caching systems at the network edge (5G small cells). This approach reduces the delay for content delivery and helps improve the performance of smart industrial applications. However, the caching management is a challenging and complex task, especially in those scenarios of shared storage resources on edge devices to support multiple concurrent applications (e.g., industrial, mobile users, and connected cars applications). In this article, we study the performance of a shared edge caching system for content delivery in smart industry and connected cars applications. To do so, we propose a mathematical framework to model the performance of a hierarchical shared edge caching system. The proposed mathematical framework considers the distinct content catalogs of the different applications (e.g., industrial and connected cars applications) and content request characteristics from industrial IoT devices and vehicles. Numerical results show that the performance of the shared edge caching system is sensitive to vehicular mobility (i.e., vehicular speed).
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.001 | 0.001 |
| 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