In some network and application scenarios, it is useful to cache content in network nodes on the fly, at line rate. Resilience of in-network caches can be improved by guaranteeing that all content therein stored is valid. Digital signatures could be indeed used to verify content integrity and provenance. However, their operation may be much slower than the line rate, thus limiting caching of cryptographically verified objects to a small subset of the forwarded ones. How this affects caching performance? To answer such a question, we devise a simple analytical approach which permits to assess performance of an LRU caching strategy storing a randomly sampled subset of requests. A key feature of our model is the ability to handle traffic beyond the traditional Independent Reference Model, thus permitting us to understand how performance vary in different temporal locality conditions. Results, also verified on real world traces, show that content integrity verification does not necessarily bring about a performance penalty; rather, in some specific (but practical) conditions, performance may even improve.

Bianchi, G., Caponi, A., Detti, A., BLEFARI MELAZZI, N. (2013). Check before storing: what is the performance price of content integrity verification in LRU caching?. COMPUTER COMMUNICATION REVIEW, 43(3), 59-67 [10.1145/2500098.2500106].

Check before storing: what is the performance price of content integrity verification in LRU caching?

BIANCHI, GIUSEPPE;DETTI, ANDREA;BLEFARI MELAZZI, NICOLA
2013-01-01

Abstract

In some network and application scenarios, it is useful to cache content in network nodes on the fly, at line rate. Resilience of in-network caches can be improved by guaranteeing that all content therein stored is valid. Digital signatures could be indeed used to verify content integrity and provenance. However, their operation may be much slower than the line rate, thus limiting caching of cryptographically verified objects to a small subset of the forwarded ones. How this affects caching performance? To answer such a question, we devise a simple analytical approach which permits to assess performance of an LRU caching strategy storing a randomly sampled subset of requests. A key feature of our model is the ability to handle traffic beyond the traditional Independent Reference Model, thus permitting us to understand how performance vary in different temporal locality conditions. Results, also verified on real world traces, show that content integrity verification does not necessarily bring about a performance penalty; rather, in some specific (but practical) conditions, performance may even improve.
2013
Pubblicato
Rilevanza internazionale
Articolo
Esperti anonimi
Settore ING-INF/03 - TELECOMUNICAZIONI
English
http://www.sigcomm.org/sites/default/files/ccr/papers/2013/July/2500098-2500106.pdf
Bianchi, G., Caponi, A., Detti, A., BLEFARI MELAZZI, N. (2013). Check before storing: what is the performance price of content integrity verification in LRU caching?. COMPUTER COMMUNICATION REVIEW, 43(3), 59-67 [10.1145/2500098.2500106].
Bianchi, G; Caponi, A; Detti, A; BLEFARI MELAZZI, N
Articolo su rivista
File in questo prodotto:
File Dimensione Formato  
official version.pdf

solo utenti autorizzati

Licenza: Copyright dell'editore
Dimensione 1.58 MB
Formato Adobe PDF
1.58 MB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2108/94609
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 73
  • ???jsp.display-item.citation.isi??? 59
social impact