MétaCan
Menu
Back to cohort
Record W2739683363 · doi:10.1109/icc.2017.7997019

An analysis of caching in information-centric vehicular networks

2017· article· en· W2739683363 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCaching and Content Delivery
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceInformation-centric networkingVehicular ad hoc networkComputer networkWireless ad hoc networkCrowdsensingDistributed computingWork (physics)State (computer science)Computer securityTelecommunicationsCacheWireless

Abstract

fetched live from OpenAlex

Information-centric networking is poised as an alternative to the address based network model, being mobility friendly and allowing for improved caching. However, VANETs, one of the biggest trends in ad-hoc networking, are defined by their peculiarities and pose additional challenges to the implementation of caching systems. The volatile nature of VANETs requires the development of specialized solutions, tailored for highly mobile environments. Towards the definition of efficient caching policies for ICN-VANETS, in this work, we discuss the current state of ICN caching in VANET, the potential hurdles that need to be overcome. We perform a series of simulations and analyze the efficiency of popular caching in various network configurations to denote current shortcomings and pinpoint potential areas where caching can be improved.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.476
Threshold uncertainty score0.380

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.002
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.010
GPT teacher head0.238
Teacher spread0.228 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations26
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicCaching and Content DeliveryFrench-language works237,207