2021
DOI: 10.26599/tst.2020.9010044
|View full text |Cite
|
Sign up to set email alerts
|

A caching strategy based on many-to-many matching game in D2D networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 10 publications
(1 citation statement)
references
References 29 publications
0
1
0
Order By: Relevance
“…In 2021, ref. [30] proposed a new caching strategy based on the existing caching placement strategies, which expresses the preference list of DUEs as the ratio of content popularity to cached probability. This caching strategy reduces latency while increasing the cache hit rate.…”
Section: Related Workmentioning
confidence: 99%
“…In 2021, ref. [30] proposed a new caching strategy based on the existing caching placement strategies, which expresses the preference list of DUEs as the ratio of content popularity to cached probability. This caching strategy reduces latency while increasing the cache hit rate.…”
Section: Related Workmentioning
confidence: 99%