Toward Dynamic Link Utilization for Efficient Vehicular Edge Content Distribution
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
With the significant advance of connected vehicles, future demand for vehicular infotainment services will be greatly increased. Traditional content distribution approaches based on typical cellular architecture suffer from long latency and unstable connections in high-dynamic vehicular environments and even may cause congestion on the backhaul network due to a large amount of requested data. In this paper, we propose a novel content delivery framework by leveraging the 5G edge networks, in which the content caching and data prefetching techniques are exploited accordingly. We investigate the comprehensive dynamic link utilization problem in 5G edge networks from the perspectives of vehicle users and network operator, respectively. For the vehicle users' perspective, our aim is to maximize the vehicular content distribution throughput through optimal scheduling of vehicular access link slots, and also the utilization problem of backhaul link slots in edge networks is studied to reduce the data access delay of vehicles. For the network operator's perspective, the objective is to maximize the total profit of the network operator, and therefore, the auction model is utilized for the vehicular access link slot scheduling and the backhaul link utilization is analyzed in terms of compensations and costs. Finally, extensive simulations are conducted to demonstrate the efficiency of the proposed solutions for edge content delivery of connected vehicles.
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.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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