ICN-Based Enhanced Cooperative Caching for Multimedia Streaming in Resource Constrained Vehicular Environment
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
Today, with the worldwide offer and rapid increment in multimedia applications on the web, the demands of users to get them accessed are also increasing prominently. The users in vehicular environment too expect efficient multimedia streaming while travelling on the road. However, the high mobility of vehicles as well as the limited transmission range of infrastructure components in IP based network provides low performance by offering high delay and additional network overhead. To provide better Quality of Experience (QoE) with high performance, Information Centric Networking (ICN) is blended with vehicular environment. Caching the content inside network nodes is inherent feature of ICN with various associated benefits such as low content retrieval delay, less network traffic, path reduction and so on. However, challenges still exists for caching the content due to resource constrained network environment (such as limited cache capacity, node battery) as well as for secure delivery of cached data. To solve these challenges and to enhance network performance, we propose a cooperative caching scheme in hierarchical network architecture that jointly considers cache location as well as combined content popularity and predicted future rating score while making caching decision. The proposed approach uses two layer hierarchical architecture where nodes in edge layer are divided into clusters. The proposed scheme uses modified Weighted Clustering Algorithms (WCA) for selection of cluster heads which are then used to decide cache location. A probability matrix is used to compute content caching probability which considers both popularity and predicted future rating of content. The proposed approach dynamically predict the user's preferences using non-negative matrix factorization (NMF) - a machine learning technique which eventually provides prediction of future rating. Based on the selection of both cache location and content to cache, the proposed scheme can effectively cache the content in the network. Further, to deal with the secure delivery of cached content, this work supports legitimate user authorization at edge nodes. The performance of the proposed scheme is evaluated in MATLAB parallel computing toolkit. The results prove significant caching improvement in terms of cache hit, hop reduction and average delay using our proposed scheme.
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.000 |
| 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