Economical Caching

Abstract. We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is a storage with a certain capacity. For each time step, an online algorithm is given a price from the interval [1, α], a consumption, and possibly a buying limit. The online algorithm has to decide the amount to purchase from some commodity, knowing the parameter α but without knowing how the price evolves in the future. The algorithm can purchase at most the buying limit. If it purchases more than the current consumption, then the excess is stored in the storage; otherwise, the gap between consumption and purchase must be taken from the storage. The goal is to minimize the total cost. Interesting applications are, for example, stream caching on mobile devices with different classes of service, battery management in micro hybrid cars, and the efficient purchase of resources. First we consider the simple but...

• Type: Conference
• Year: 2009
• Where: STACS
• Authors: Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking
• Keywords: Algorithm, Competitive Ratio, Online Algorithm, STACS 2009, Theoretical Computer Science