We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Optimal Prefetching in Random Trees.
- Authors
Keshava, Kausthub; Jean-Marie, Alain; Alouf, Sara
- Abstract
We propose and analyze a model for optimizing the prefetching of documents, in the situation where the connection between documents is discovered progressively. A random surfer moves along the edges of a random tree representing possible sequences of documents, which is known to a controller only up to depth d. A quantity k of documents can be prefetched between two movements. The question is to determine which nodes of the known tree should be prefetched so as to minimize the probability of the surfer moving to a node not prefetched. We analyzed the model with the tools of Markov decision process theory. We formally identified the optimal policy in several situations, and we identified it numerically in others.
- Subjects
TREES; SURFERS
- Publication
Mathematics (2227-7390), 2021, Vol 9, Issue 19, p2437
- ISSN
2227-7390
- Publication type
Article
- DOI
10.3390/math9192437