2016 IEEE Symposium on Computers and Communication (ISCC) 2016
DOI: 10.1109/iscc.2016.7543869
|View full text |Cite
|
Sign up to set email alerts
|

Over-The-Top Catch-up TV content-aware caching

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

2018
2018
2022
2022

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 10 publications
0
5
0
Order By: Relevance
“…On the other hand, there have been many studies on cache update [ 14 , 15 , 16 , 17 , 18 , 19 ]. The performance of FIFO, the least recently used (LRU), and the least frequently used (LFU) schemes was analyzed in terms of the rate at which a particular request is returned before a given deadline [ 14 ] and in terms of hit rate [ 15 ].…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…On the other hand, there have been many studies on cache update [ 14 , 15 , 16 , 17 , 18 , 19 ]. The performance of FIFO, the least recently used (LRU), and the least frequently used (LFU) schemes was analyzed in terms of the rate at which a particular request is returned before a given deadline [ 14 ] and in terms of hit rate [ 15 ].…”
Section: Related Workmentioning
confidence: 99%
“…The performance of FIFO, the least recently used (LRU), and the least frequently used (LFU) schemes was analyzed in terms of the rate at which a particular request is returned before a given deadline [ 14 ] and in terms of hit rate [ 15 ]. A novel content-aware cache replacement algorithm taking advantage of content demand forecasts was investigated to efficiently use limited caches in size [ 16 ]. LRU-K, which is a combination of LRU and LFU, was proposed [ 17 ].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…• Least frequently used (LFU) depends on the frequency of requests as an indicator of the popularity of content where the content with the lowest request count is evicted from the cache to make room for new content. LFU suffers from gradual performance degradation because previously-cached unpopular content which received a high number of historic requests remains in the cache, such a phenomenon is known as cache pollution [18].…”
Section: A Traditional Caching Schemementioning
confidence: 99%
“…As mentioned earlier, the number of viewers is usually used to denote videos popularity, but some researchers suggest other popularity measures such in [18] and [61]. Nogueira et al [18] introduced expected priority and designed a caching scheme that favored TV shows with a greater expected priority, at the expense of others with lower expected priorities. Higher priorities map to higher expectations that an item is going to be requested in the future.…”
Section: ) Models Based On Metadatamentioning
confidence: 99%