Paging against a distribution and IP networking

In this paper we consider the paging problem when the page request sequence is drawnfrom a distribution, and give an application to computer networking.In the IP-paging problem the page inter-request times are chosen according to independentdistributions. For this model we construct a very simple deterministic algorithmwhose page fault rate is at most 5 times that of the best online algorithm (that knowsthe inter-request time distributions). We also show that many other natural algorithms...