Check before storing: what is the performance price of content integrity verification in LRU caching?
Check before storing: what is the performance price of content integrity verification in LRU caching?
复制标题
DOI：
10.1145/2500098.2500106
复制
发表时间：
2013-07
期刊：
影响因子：
--
通讯作者：
G. Bianchi;A. Detti;A. Caponi;N. Blefari-Melazzi
中科院分区：
文献类型：
--
作者：
G. Bianchi;A. Detti;A. Caponi;N. Blefari-Melazzi
在某些网络和应用场景中，以线速率动态地在网络节点中缓存内容是很有用的。通过保证存储在其中的所有内容都是有效的，可以提高网络内缓存的弹性。数字签名确实可以用来验证内容的完整性和来源。但是，它们的操作可能比线路速率慢得多，因此将加密验证对象的缓存限制为转发对象的一小部分。这对缓存性能有何影响？为了回答这样的问题，我们设计了一种简单的分析方法，允许评估存储随机抽样请求子集的LRU缓存策略的性能。我们模型的一个关键特征是能够处理超出传统独立参考模型的流量，从而使我们能够了解性能在不同时间局域条件下的变化。结果，也验证了现实世界的痕迹，表明内容完整性验证并不一定会带来性能损失；相反，在某些特定的（但实际的）条件下，性能甚至可能得到改善。
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.