Albeit an important goal of caching is traffic reduction, a perhaps even more important aspect follows from the above achievement: the reduction of internet service provider (ISP) operational costs that comes as a consequence of the reduced load on transit and provider links. Surprisingly, to date this crucial aspect has not been properly taken into account in cache design. In this paper, we show that the classic caching efficiency indicator, i.e., the hit ratio, conflicts with cost. We therefore propose a mechanism whose goal is the reduction of cost and, in particular, we design a cost-aware (CoA) cache decision policy that, leveraging price heterogeneity among external links, tends to store with more probability the objects that the ISP has to retrieve through the most expensive links. We provide a model of our mechanism, based on Che's approximation, and, by means of a thorough simulation campaign, we contrast it with traditional cost-blind schemes, showing that CoA yields a significant cost saving, that is furthermore consistent over a wide range of scenarios. We show that CoA is easy to implement and robust, making the proposal of practical relevance.

(2016). Cost-Aware Caching: Caching More (Costly Items) for Less (ISPs Operational Expenditures) [journal article - articolo]. In IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS. Retrieved from http://hdl.handle.net/10446/106060

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

Martignon, Fabio
2016-01-01

Abstract

Albeit an important goal of caching is traffic reduction, a perhaps even more important aspect follows from the above achievement: the reduction of internet service provider (ISP) operational costs that comes as a consequence of the reduced load on transit and provider links. Surprisingly, to date this crucial aspect has not been properly taken into account in cache design. In this paper, we show that the classic caching efficiency indicator, i.e., the hit ratio, conflicts with cost. We therefore propose a mechanism whose goal is the reduction of cost and, in particular, we design a cost-aware (CoA) cache decision policy that, leveraging price heterogeneity among external links, tends to store with more probability the objects that the ISP has to retrieve through the most expensive links. We provide a model of our mechanism, based on Che's approximation, and, by means of a thorough simulation campaign, we contrast it with traditional cost-blind schemes, showing that CoA yields a significant cost saving, that is furthermore consistent over a wide range of scenarios. We show that CoA is easy to implement and robust, making the proposal of practical relevance.
articolo
2016
Araldo, Andrea; Rossi, Dario; Martignon, Fabio
(2016). Cost-Aware Caching: Caching More (Costly Items) for Less (ISPs Operational Expenditures) [journal article - articolo]. In IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS. Retrieved from http://hdl.handle.net/10446/106060
File allegato/i alla scheda:
File Dimensione del file Formato  
TPDS_2015.pdf

accesso aperto

Descrizione: “© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.”
Versione: postprint - versione referata/accettata senza referaggio
Licenza: Licenza default Aisberg
Dimensione del file 688.55 kB
Formato Adobe PDF
688.55 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10446/106060
Citazioni
  • Scopus 39
  • ???jsp.display-item.citation.isi??? 38
social impact