Cost-Aware Caching: Caching More (Costly Items) for Less (ISPs Operational Expenditures)

Araldo, Andrea; Rossi, Dario; Martignon, Fabio

doi:10.1109/tpds.2015.2433296

Cited by 50 publications

(32 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[1,2,3,4] mentioned in the introduction). None of them tries to address the general problem we target in this paper, but we rely on two results from [4] that do not actually depend on the specific cost considered there.…”

Section: Background and Related Workmentioning

confidence: 99%

Cache policies for linear utility maximization

Neglia

Carra²,

Michiardi³

2017

IEEE INFOCOM 2017 - IEEE Conference on Computer Communications

View full text Add to dashboard Cite

Cache policies to minimize the content retrieval cost have been studied through competitive analysis when the miss costs are additive and the sequence of content requests is arbitrary. More recently, a cache utility maximization problem has been introduced, where contents have stationary popularities and utilities are strictly concave in the hit rates. This paper bridges the two formulations, considering linear costs and content popularities. We show that minimizing the retrieval cost corresponds to solving an online knapsack problem, and we propose new dynamic policies inspired by simulated annealing, including DynqLRU, a variant of qLRU. For such policies we prove asymptotic convergence to the optimum under the characteristic time approximation. In a real scenario, popularities vary over time and their estimation is very difficult. DynqLRU does not require popularity estimation, and our realistic, trace-driven evaluation shows that it significantly outperforms state-of-the-art policies, with up to 45% cost reduction. Notice: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

show abstract

Section: Background and Related Workmentioning

confidence: 99%

Cache policies for linear utility maximization

Neglia

Carra²,

Michiardi³

2017

IEEE INFOCOM 2017 - IEEE Conference on Computer Communications

View full text Add to dashboard Cite

show abstract

“…Web caching, as discussed before, reduces bandwidth consumption, transmission delays, and the server workload. It also allows for greater network utilization, decreased network traffic, lower operational expenses [98] and enables centralized monitoring and management of the data flowing in and out of a network.…”

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

“…Furthermore, inter-ISP issues related to in-network caching (e.g., savings from transit traffic) and new pricing models have been investigated in [21], [22], [20]. Motivated by similar concerns on the cost implications of caching, the authors in [23] design a "Cost-Aware cache decision policy", based on which caches hold the content that will bring the most savings to the ISP in terms of transit traffic.…”

Section: Cache Allocation and Economic Incentivesmentioning

confidence: 99%

Efficient Hash-routing and Domain Clustering Techniques for Information-Centric Networks

et al. 2016

View full text Add to dashboard Cite

Hash-routing is a well-known technique used in server-cluster environments to direct content requests to the responsible servers hosting the requested content. In this work, we look at hash-routing from a different angle and apply the technique to Information-Centric Networking (ICN) environments, where in-network content caches serve as temporary storage for content. In particular, edge-domain routers re-direct requests to in-network caches, more often than not off the shortest path, according to the hash-assignment function. Although the benefits of this off-path in-network caching scheme are significant (e.g., high cache hit rate with minimal co-ordination overhead), the basic scheme comes with disadvantages. That is, in case of very large domains the off-path detour of requests might increase latency to prohibitive levels. In order to deal with extensive detour delays, we investigate nodal/domain clustering techniques, according to which large domains are split in clusters, which in turn apply hash-routing in the subset of nodes of each cluster. We model and evaluate the behaviour of nodal clustering and report significant improvement in delivery latency, which comes at the cost of a slight decrease in cache hit rates (i.e., up to 50% improvement in delivery latency for less than 10% decrease in cache hit rate compared to the original hash-routing scheme applied in the whole domain).

show abstract

Cost-Aware Caching: Caching More (Costly Items) for Less (ISPs Operational Expenditures)

Cited by 50 publications

References 38 publications

Cache policies for linear utility maximization

Cache policies for linear utility maximization

Efficient HTTP-based Adaptive Streaming of Linear and Interactive Videos

Efficient Hash-routing and Domain Clustering Techniques for Information-Centric Networks

Contact Info

Product

Resources

About