Abstract
We continue the study of the integrated document and connection caching problem. We focus on the case where the connection cache has a size of one and show that this problem is not equivalent to standard paging, even if there are only two locations for the pages, by giving the first lower bound that is strictly higher than k for this problem.
We then give the first upper bound below the trivial value of 2k for this problem. Our upper bound is k+4l where l is the number of locations where the requested pages in a phase come from.
This algorithm groups pages by location. In each phase, it evicts all pages from one location before moving on to the next location.
In contrast, we show that the lru algorithm is not better than 2k-competitive.