{'fraction_non_alphanumeric': 0.017543859649122806, 'fraction_numerical': 0.0, 'mean_word_length': 4.986013986013986, '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}}
A New Replica Selection Strategy Based on Combination Algorithm

In the data grid environment, when users access to files, how to select the best site to obtain files from multiple replicas and reach the highest QOS(quality of service) in the cost of same price is a problem that need to be studied urgently, that is replica selection. In this paper, it proposes a new combination algorithm based on genetic algorithm and ant algorithm, which not only solves the inefficient disadvantage of genetic algorithm, but also solves the problem of solving problems slowly in the early period in ant algorithm. This strategy is analyzed and simulated by data grid simulator OptorSim, and the results show that this new algorithm can be effective in reducing data access latency, improve data access speed, speed up job completion time, and achieve load balancing.