2022
DOI: 10.1109/tits.2021.3052355
|View full text |Cite
|
Sign up to set email alerts
|

Towards Hit-Interruption Tradeoff in Vehicular Edge Caching: Algorithm and Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 40 publications
0
5
0
Order By: Relevance
“…Wang and Grace [205] suggested two proactive caching algorithms based on multi-armed bandit learning, using reinforcement learning to predict the next RSU that a vehicle will pass through to achieve proactive caching in vehicular networks. Zhang et al [209] studied the vehicular edge caching challenge in real vehicle scenarios, designing an adaptive caching algorithm to more effectively utilize caching resources, increase caching prediction success rates, and reduce interruptions in caching services. Fu [210] proposed caching update and pricing algorithms, considering the transcoding of various video versions.…”
Section: Cachingmentioning
confidence: 99%
“…Wang and Grace [205] suggested two proactive caching algorithms based on multi-armed bandit learning, using reinforcement learning to predict the next RSU that a vehicle will pass through to achieve proactive caching in vehicular networks. Zhang et al [209] studied the vehicular edge caching challenge in real vehicle scenarios, designing an adaptive caching algorithm to more effectively utilize caching resources, increase caching prediction success rates, and reduce interruptions in caching services. Fu [210] proposed caching update and pricing algorithms, considering the transcoding of various video versions.…”
Section: Cachingmentioning
confidence: 99%
“…Step 2: In this step, we introduce a greedy offline strategy with utility in cache period l denoted by u ′′ (l). At the beginning of cache period l, the greedy offline strategy releases all contents, and performs purchasing and caching in cache period l so as to maximize the ENSP's utility in cache period l. 6 Note that in both greedy offline strategy and modified offline strategy, the ENSP has no cached content at the beginning of each cache period. The greedy offline strategy focuses on utility maximization in the current cache period, while the modified offline strategy follows the offline optimal strategy that focuses on long-term utility maximization over all cache periods.…”
Section: Competitive Ratio Analysismentioning
confidence: 99%
“…Recently, content popularity prediction has been adopted in many caching strategy designs, as information of content popularity can help to increase the cache hit rate. The work in [6] developed an online regression based on the Gaussian process algorithm to make short-term prediction for contents in vehicular edge caching networks. The work in [7] utilized a temporal convolution network and an attention mechanism to learn content popularity patterns for achieving the hit rate maximization.…”
Section: Introductionmentioning
confidence: 99%
“…Network content was modeled as a heterogeneous information network so that network congestion can be significantly alleviated. In order to improve the cache hit rate and to avoid frequent interruption of cache request services, [18] proposed an on-demand adaptive cache scheme which adjusted the replacement time of cached content according to the requests and the popularity of the content. However, the above works only considered V2I communication in edge caching, making them hard to be adopted to IoV scenarios with poor or no MEC coverage.…”
Section: Related Workmentioning
confidence: 99%