An approximate analysis of the LRU and FIFO buffer replacement schemes
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Generating representative Web workloads for network and server performance evaluation
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Probabilistic methods for web caching
Performance Evaluation
Operating Systems Theory
Optimizing LRU Caching for Variable Document Sizes
Combinatorics, Probability and Computing
Communications of the ACM - Interaction design and children
Insight and perspectives for content delivery networks
Communications of the ACM - Personal information management
The LCD interconnection of LRU caches and its analysis
Performance Evaluation
A data-oriented (and beyond) network architecture
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Pollution attacks and defenses for Internet caching systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Schnorr-Like Lightweight Identity-Based Signature Scheme
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Deterministic versus probabilistic packet sampling in the internet
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Proceedings of the ACM SIGCOMM 2010 conference
Naming in content-oriented architectures
Proceedings of the ACM SIGCOMM workshop on Information-centric networking
Information-centric networking: seeing the forest for the trees
Proceedings of the 10th ACM Workshop on Hot Topics in Networks
Towards name-based trust and security for content-centric network
ICNP '11 Proceedings of the 2011 19th IEEE International Conference on Network Protocols
Hierarchical Web caching systems: modeling, design and experimental results
IEEE Journal on Selected Areas in Communications
Cache "less for more" in information-centric networks
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
Transport-layer issues in information centric networks
Proceedings of the second edition of the ICN workshop on Information-centric networking
Probabilistic in-network caching for information-centric networks
Proceedings of the second edition of the ICN workshop on Information-centric networking
Privacy risks in named data networking: what is the cost of performance?
ACM SIGCOMM Computer Communication Review
A versatile and accurate approximation for LRU cache performance
Proceedings of the 24th International Teletraffic Congress
| Hi-index | 0.00 |
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.