The IP-paging problem is motivation by the following application to data networks. We construct a simple randomized algorithm whose page fault rate is at most four times that of the best online algorithm. Indistributional pagingthe interrequest time distributions may be dependent, and hence, any probabilistic model of page request sequences can be represented. We also show that many other natural algorithms for this problem do not have constant competitive ratio. algorithm (that knows the interrequest time distributions). For this model we construct a very simple deterministic algorithm whose page fault rate is at most five times that of the best online.
In theIP-paging problemthe page interrequest times are chosen according to independent distributions. In this paper we consider the paging problem when the page request sequence is drawn from a distribution and we give an application to computer networking.
0 kommentar(er)
