{'fraction_non_alphanumeric': 0.02027027027027027, 'fraction_numerical': 0.0, 'mean_word_length': 5.356223175965665, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Prefetching Control for On-Demand Contents Distribution: A Markov Decision Process Model

Prefetching control is a vital operation for the On-demand interactive systems where the instantaneous response is the crucial factor for the system success. The controller in such type of interactive system operates in an uncertain environment and makes sequences of decisions with long and short term stochastic effects. The difficulty, then, is to determine at every system state which contents to prefect into the cache. We address the prefetching control problem in which the controller seeks to reach a Zero-Cost system state as quickly as possible while minimizing costs along the way (i.e. taking the shortest path). We model this control problem as a Negative Stochastic Dynamic Programming problem in which we minimize the undiscounted total expected cost. Our first contribution is formulating the prefetching problem as a control problem using the Markov Decision Process formalism. Our control model, PREF-CT, integrates the main models necessary for an adequate prefetching control operation, the prediction model, the access model, the network resource model, and the performance model. Our second contribution is the detection of a special structure of the optimal prefetching policy. Exploiting this special structure permits to develop two strategically different algorithms, ONE-PASS and TREE-DEC, which improve the complexity of computing the optimal prefetching policy.