This project provides tools to simulate several access strategies for distributed caching. The simulator considers a user who is equipped by several caches, and receives from them periodical updates about the cached content. These updates are not totally accurate. The user has to select which caches to access, to obtain the requested datum in the lowest price and maximum certainty possible.
This is a simulator for access strategies for distributed caching. The simulator considers a user who is equipped by several caches, and receives from them periodical updates about the cached content. The problem and algorithms implemented here are detailed in the paper: I. Cohen, G. Einziger, R. Friedman, and G. Scalosub, “Access Strategies for Network Caching”, IEEE/ACM Transactions on Networking, 29(2), pp. 609-622, 2021.