Category-aware hierarchical caching for video-on-demand content on youtube

Koch, Christian; Pfannmüller, Johannes; Rizk, Amr; Hausheer, David; Steinmetz, Ralf

doi:10.1145/3204949.3204963

Cited by 13 publications

(3 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Other related caching algorithms, but not TTL specific [35,36], attempt to minimize the average cost of misses, where the cost of an object is given by, for example, the variability in latency or computation cost. Other approaches that consider cache optimization such as [37][38][39][40][41], attempt to optimize given cache utility offline. This is different from the approach of the paper at hand as we model caching under non-zero random object fetching delays.…”

Section: Analysis Of Ttl Cache Hierarchiesmentioning

confidence: 99%

On the Impact of Network Delays on Time-to-Live Caching

El‐Sayed¹,

Rizk²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

We consider Time-to-Live (TTL) caches that tag every object in cache with a specific (and possibly renewable) expiration time. State-of-the-art models for TTL caches assume zero object fetch delay, i.e., the time required to fetch a requested object that is not in cache from a different cache or the origin server. Particularly, in cache hierarchies this delay has a significant impact on performance metrics such as the object hit probability. Recent work suggests that the impact of the object fetch delay on the cache performance will continue to increase due to the scaling mismatch between shrinking inter-request times (due to higher data center link rates) in contrast to processing and memory access times.In this paper, we analyze tree-based cache hierarchies with random object fetch delays and provide an exact analysis of the corresponding object hit probability. Our analysis allows understanding the impact of random delays and TTLs on cache metrics for a wide class of request stream models characterized through Markov arrival processes. This is expressed through a metric that we denote delay impairment of the hit probability. In addition, we analyze and extend state-of-the-art approximations of the hit probability to take the delay into account. We provide numerical and trace-based simulation-based evaluation results showing that larger TTLs do not efficiently compensate the detrimental effect of object fetch delays. Our evaluations also show that unlike our exact model the state-of-the-art approximations do not capture the impact of the object fetch delay well especially for cache hierarchies. Surprisingly, we show that the impact of this delay on the hit probability is not monotonic but depends on the request stream properties, as well as, the TTL.

show abstract

Section: Analysis Of Ttl Cache Hierarchiesmentioning

confidence: 99%

On the Impact of Network Delays on Time-to-Live Caching

El‐Sayed¹,

Rizk²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…server offloading [52], and transport costs [127], as well as content popularity and content awareness [90,152] has been pursued in recent years. Many works such as [122,102,36,158] propose new caching strategies to improve CDN hit rates and eventually enhance video QoE.…”

Section: Related Workmentioning

confidence: 99%

Fully Dual Closed Stable Modules

Al-Aeashi

Diop

Farahani

2020

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

show abstract

“…Industry insiders estimated that Douyin outstripped YouTube, Facebook, Instagram, and Snapchat in total downloads in September 2018 [10], and Sensor Tower estimates that Douyin has surpassed one billion installs on the App Store and Google Play in February 2019 [11]. On the other hand, some studies such as YouTube [8] and Twitter [12], have analyzed different characteristics, for studying caching mechanism. Different from YouTube and Twitter, Douyin is specially designed to provide short videos for the mobile Internet users.…”

Section: Introductionmentioning

confidence: 99%

A study on the characteristics of douyin short videos and implications for edge caching

Chen

Qian

Mao

et al. 2019

Proceedings of the ACM Turing Celebration Conference - China

View full text Add to dashboard Cite

Douyin, internationally known as TikTok, has become one of the most successful short-video platforms. To maintain its popularity, Douyin has to provide better Quality of Experience (QoE) to its growing user base. Understanding the characteristics of Douyin videos is thus critical to its service improvement and system design. In this paper, we present an initial study on the fundamental characteristics of Douyin videos based on a dataset of over 260 thousand short videos collected across three months. The characteristics of Douyin videos are found to be significantly different from traditional online videos, ranging from video bitrate, size, to popularity. In particular, the distributions of the bitrate and size of videos follow Weibull distribution. We further observe that the most popular Douyin videos follow Zifp's law on video popularity, but rest of the videos do not. We also investigate the correlation between popularity metrics used for Douyin videos. It is found that the correlation between the number of views and the number of likes are strong, while other correlations are relatively low. Finally, by using a case study, we demonstrate that the above findings can provide important guidance on designing an efficient edge caching system.

show abstract

Category-aware hierarchical caching for video-on-demand content on youtube

Cited by 13 publications

References 27 publications

On the Impact of Network Delays on Time-to-Live Caching

On the Impact of Network Delays on Time-to-Live Caching

Fully Dual Closed Stable Modules

A study on the characteristics of douyin short videos and implications for edge caching

Contact Info

Product

Resources

About