Affiliation:
1. University of Roma Tor Vergata, Rome, Italy
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Software
Reference34 articles.
1. Standards for efficient cryptography group (SECG) SEC4 Elliptic Curve Qu-Vanstone implicit Certificate Scheme (ECQV). v1.0 January 2013. Standards for efficient cryptography group (SECG) SEC4 Elliptic Curve Qu-Vanstone implicit Certificate Scheme (ECQV). v1.0 January 2013.
2. A survey of information-centric networking
3. M. Ahmed S. Traverso P. Giaccone E. Leonardi and S. Niccolini. Analyzing the Performance of LRU Caches under Non-Stationary Traffic Patterns. ArXiv abs/1301.4909 2013. M. Ahmed S. Traverso P. Giaccone E. Leonardi and S. Niccolini. Analyzing the Performance of LRU Caches under Non-Stationary Traffic Patterns. ArXiv abs/1301.4909 2013.
4. Generating representative Web workloads for network and server performance evaluation
5. Self-verifying names for read-only named data
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献