A new bound for space bounded server algorithms

Abstract

This paper studies the competitive factor of space bounded algorithms for the k-server problem operating in finite metric spaces. Specifically, two methods are developed for obtaining an upper bound on competitive factors of arbitrary space bounded algorithms. One of these methods is then used to show that an LRU-like algorithm is linearly-competitive on a uniform metric space.