Optimal caching for producer mobility support in Named Data Networks
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
Named Data Networks (NDNs) offer a promising paradigm for the future Internet to cope with the growing demand for data. One of the main challenges in NDNs is how to support a seamless operation during mobility. In this paper, we investigate optimal caching for Producer mobility support and propose a scheme (named OpCacheMob) that exploits location predictors and data requests' patterns to cache the data proactively before handover occurs. In essence, OpCacheMob adopts the predicted future Interests, that will be sent to the mobile producers, and caches their data contents ahead. Thus, avoids Interest retransmission or redirection that increase the consumer's delay and decreases the network efficiency during producer's mobility. We provide a mathematical formulation for such caching problem that bounds both the cache update cost and the consumer delay while minimizing the total network overhead due to the change of content availability. OpCacheMob is then implemented in ndnSIM and evaluated against mainstream NDN mobility solutions. We demonstrate how the scheme can be used as a benchmark to measure the performance of other mobility schemes. In addition, a sensitivity analysis is presented to measure the impact of errors on the prediction gain of such solution.
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.001 | 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.001 |
| Open science | 0.001 | 0.001 |
| 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