Skip to content

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…

Notifications You must be signed in to change notification settings

ofanan/accessStrategies

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

15 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Access Strategies for Network Caching

This project provides simulation tools to test several access strategies for distributed caching in the typical practical case, where the information about the cached content may be stale. In this problem, a user, who is equipped with several caches, receives periodical updates about the cached content; such updates are commonly called indicators. The user has to select which caches to access, to obtain the requested datum at the lowest price and maximum certainty possible.

For details about the problem and the algorithms used, please refer to the paper:

[1] I. Cohen, Gil Einziger, R. Friedman, and G. Scalosub, Access Strategies for Network Caching, IEEE Transactions on Networking, Vol. 29(2), 2021, pp.609-622.

Note: this is an obsolete repo. Newer projects with more advanced capabilities can be found in the FIAT repo.

About

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…

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages