Optimum Object Selection Made Easy
We propose a simple scheme for selecting objects (either for caching or picking objects that are peers in a peer-to-peer system) to maximize the long-run reward obtained by a system. Our approach does not require a detailed record of the value specific objects add to the system. Therefore, it can be implemented using less computing and memory resources as compared to machine learning and artificial intelligent algorithms. One of the main contributions we make is to show that one can still derive optimal policies. The model that we use and the policy that we present are both applicable in a variety of contexts.
optimization object selection caching policy