Online paging when the cache does not come for free

this paper. In allprevious work on online paging a basic assumption isthat the cache size k is fixed a priori and cannot bechanged. In this paper, we consider the situation whereat any moment in time the algorithm may increase itscache size by purchasing additional cache slots. If its