Ephemeral Content Popularity at the Edge and Implications for On-Demand Caching

Carlsson, Niklas; Eager, Derek L.

doi:10.1109/tpds.2016.2614805

Cited by 48 publications

(40 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are several tradeoffs in this area and the choice of replacement strategy has to be fine-tuned based on the use case and the factors to be optimized. Intelligent cache insertion policies have also been proposed to take into account the long tail of one-time requests [87], [103].…”

Section: Http Cachingmentioning

confidence: 99%

Efficient HTTP-based Adaptive Streaming of Linear and Interactive Videos

Krishnamoorthi¹

2018

Linköping Studies in Science and Technology. Dissertations

View full text Add to dashboard Cite

Online video streaming has gained tremendous popularity over recent years and currently constitutes the majority of Internet traffic. As large-scale ondemand streaming continues to gain popularity, several important questions and challenges remain unanswered. This thesis addresses open questions in the areas of efficient content delivery for HTTP-based Adaptive Streaming (HAS) from different perspectives (client, network and content provider) and in the design, implementation, and evaluation of interactive streaming applications over HAS.As streaming usage scales and new streaming services emerge, continuous improvements are required to both the infrastructure and the techniques used to deliver high-quality streams. In the context of Content Delivery Network (CDN) nodes or proxies, this thesis investigates the interaction between HAS clients and proxy caches. In particular, we propose and evaluate classes of content-aware and collaborative policies that take advantage of information that is already available, or share information among elements in the delivery chain, where all involved parties can benefit. Asides from the users' playback experience, it is also important for content providers to minimize users' startup times. We have designed and evaluated different classes of client-side policies that can prefetch data from the videos that the users are most likely to watch next, without negatively affecting the currently watched video. To help network providers to monitor and ensure that their customers enjoy good playback experiences, we have proposed and evaluated techniques that can be used to estimate clients' current buffer conditions. Since several services today stream over HTTPS, our solution is adapted to predict client buffer conditions by only observing encrypted network-level traffic. Our solution allows the operator to identify clients with low-buffer conditions and implement policies that help avoid playback stalls.The emergence of HAS as the de facto standard for delivering streaming content also opens the door to use it to deliver the next generation of streaming services, such as various forms of interactive services. This class of services is gaining popularity and is expected to be the next big thing in entertainment. For the area of interactive streaming, this thesis proposes, models, designs, and evaluates novel streaming applications such as interactive branched videos and multi-video stream bundles. For these applications, we design and evaluate careful prefetching policies that provides seamless playback (without stalls or switching delay) even when interactive branched video viewers defer their choices to the last possible moment and when users switches between alternative streams within multi-video stream bundles. Using optimization frameworks, we design and implement effective buffer management techniques for seamless playback experiences and evaluate several tradeoffs using our policies. Populärvetenskaplig sammanfattningInternet och World Wide Web (WWW) har vuxit till vik...

show abstract

Section: Http Cachingmentioning

confidence: 99%

Efficient HTTP-based Adaptive Streaming of Linear and Interactive Videos

Krishnamoorthi¹

2018

Linköping Studies in Science and Technology. Dissertations

View full text Add to dashboard Cite

show abstract

“…Most existing caching works focus on replacement policies [2,26]. However, recently it has been shown that the cache insertion policies play a very important factor in reducing the total delivery costs [6,24]. Motivated by these works, this paper focuses on the delivery cost differences between different selective cache insertion policies.…”

Section: Related Workmentioning

confidence: 99%

“…This class of policies is motivated by the risk of cache pollution due to ephemeral content popularity and the long tail of one-timers (one-hit wonders) observed in edge networks [6,20,24,27]. Recent works including trace-based evaluations of cache on M th request policies [6,24]. Carlsson and Eager [6] also present simple analytic models for hit and insertion probabilities.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Worst-case bounds and optimized cache on Mth request cache insertion policies under elastic conditions

Carlsson

Eager

2018

Performance Evaluation

Self Cite

View full text Add to dashboard Cite

Cloud services and other shared third-party infrastructures allow individual content providers to easily scale their services based on current resource demands. In this paper, we consider an individual content provider that wants to minimize its delivery costs under the assumptions that the storage and bandwidth resources it requires are elastic, the content provider only pays for the resources that it consumes, and costs are proportional to the resource usage. Within this context, we (i) derive worst-case bounds for the optimal cost and competitive cost ratios of different classes of cache on M th request cache insertion policies, (ii) derive explicit average cost expressions and bounds under arbitrary inter-request distributions, (iii) derive explicit average cost expressions and bounds for shorttailed (deterministic, Erlang, and exponential) and heavy-tailed (Pareto) inter-request distributions, and (iv) present numeric and trace-based evaluations that reveal insights into the relative cost performance of the policies. Our results show that a window-based cache on 2 nd request policy using a single threshold optimized to minimize worst-case costs provides good average performance across the different distributions and the full parameter ranges of each considered distribution, making it an attractive choice for a wide range of practical conditions where request rates of individual file objects typically are not known and can change quickly. KEYWORDSCaching, Worst-case bounds, Optimized insertion policies * This is the authors' version of a work that was accepted for publication in IFIP Performance, Toulouse, France, Dec.

show abstract

“…Typically, content objects are added to the cache whenever they are requested and the cache does not contain a copy, and one of several cache replacement strategies is used by the proxy cache to chose whether to write over a piece of data or not. More intelligent cache insertion policies have recently been proposed to take into account the long tail of one-time requests [21], [22].…”

Section: Web Caching and Caching Of Http-based Streamsmentioning

confidence: 99%

Efficient and Adaptive Content Delivery of Linear and Interactive Branched Videos

Krishnamoorthi¹

2016

View full text Add to dashboard Cite

Video streaming over the Internet has gained tremendous popularity over recent years and currently constitutes the majority of Internet traffic. The on-demand delivery of high quality video streaming has been enabled by a combination of consistent improvements in residential download speeds, HTTP-based Adaptive Streaming (HAS), extensive content caching, and the use of Content Distribution Networks (CDNs). However, as large-scale on-demand streaming is gaining popularity, several important questions and challenges remain unanswered, including determining how the infrastructure can best be leveraged to provide users with the best possible playback experience. In addition, it is important to develop new techniques and protocols that facilitate the next generation of streaming applications. Innovative services such as interactive branched streaming are gaining popularity and are expected to be the next big thing in on-demand entertainment. The major contributions of this thesis are in the area of efficient content delivery of video streams using HAS. To address the two challenges above, the work utilizes a combination of different methods and tools, ranging from real-world measurements, characterization of system performance, proof-of-concept implementations, protocol optimization, and evaluation under realistic environments. First, through careful experiments, we evaluate the performance impact and interaction of HAS clients with proxy caches. Having studied the typical interactions between HAS clients and caches, we then design and evaluate content-aware policies to be used by the proxy caches, which parse the client requests and prefetch the chunks that are most likely to be requested next. In addition, we also design cooperative policies in which clients and proxies share information about the playback session. Our evaluations reveal that, in general, the bottleneck location and network conditions play central roles in which policy choices are most advantageous, and the location of the bottlenecks significantly impact the relative performance differences between policy classes. We also show that careful design and policy selection is important when trying to enhance HAS performance using proxy assistance. Second, this thesis proposes, models, designs, and evaluates novel streaming applications such as interactive branched videos. In such videos, users can influence the content that is being shown to them. We design and evaluate careful prefetching policies that provides seamless playback even when the users defer their path choices to the last possible moment. We derive optimized prefetching policies using an optimization framework, design and implement effective buffer management techniques for seamless playback at branch points, and use parallel TCP connections to achieve efficient buffer workahead. Through performance evaluations, we show that our policies can effectively prefetch data of carefully adapted qualities along multiple alternative paths so to ensure seamless playback, offering users a ple...

show abstract

Ephemeral Content Popularity at the Edge and Implications for On-Demand Caching

Cited by 48 publications

References 38 publications

Efficient HTTP-based Adaptive Streaming of Linear and Interactive Videos

Efficient HTTP-based Adaptive Streaming of Linear and Interactive Videos

Worst-case bounds and optimized cache on Mth request cache insertion policies under elastic conditions

Efficient and Adaptive Content Delivery of Linear and Interactive Branched Videos

Contact Info

Product

Resources

About