{'fraction_non_alphanumeric': 0.012668250197941409, 'fraction_numerical': 0.0, 'mean_word_length': 5.482051282051282, '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}}
Modeling replication strategies in data grid systems with arbitrary clustered demands

This paper considers the relationship between request distribution and replica distribution in data grid when request exhibits arbitrary clustered demands. We first give formal model of replication strategies in data grid system. Second, we investigate what is optimal way at the objective of minimizing average access latency to replicate data when request exhibits arbitrary clustered demands. We explain why replicas should be replicated uniformly when request is uniformly distributed in a sub grid in the sense of optimal strategy. Then we investigate the relationship between different files in a sub grid. Furthermore, we analyze the case when all sub grids are equal-sized and conclude that when request is uniformly distributed in system, replicas should be uniformly distributed in system too. Finally, we give an optimal strategy when sub grids are not equal-sized and different sub grids exhibit different request clustering patterns. Compared with some popular strategies, the optimal strategy has some advantages of lower wide area network bandwidth requirement and lower average access latency. Simulation results validate the effectiveness of optimal strategy.