Flexible Evaluation Caching Using FATE

Abstract

Many algorithms have been presented to enhance caching in the Internet, and LRU (Least Recently Used) is the defacto standard used to evict data due to its ease of implementation and good performance. A limitation in creating a new caching algorithm is the cost associated with its development, testing, analysis, and efficiency in specific scenarios. The Functional Algebraic aTomic Evaluators (FATE) is introduced to address this problem. FATE is an information processing engine that evaluates information (such as the value of cached content) and acts upon said results. FATE is designed to be highly configurable and flexible, and to enable rapid development, accuracy in duplicate functionality on different platforms, and ease of use. It uses XML configuration files to setup the evaluation of the content. Each algorithm in FATE can be used as-is or optimized.