{'fraction_non_alphanumeric': 0.016795865633074936, 'fraction_numerical': 0.0, 'mean_word_length': 5.2, '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}}
Estimating the task route reliability of mobile agent-based systems using Monte Carlo simulation

In this paper we propose two algorithms for estimating the task route reliability of mobile agent-based systems (MABS), which are based on the conditions of the underlying computer network. In addition, we propose a third algorithm for generating a random static planning strategy for mobile agents. The complexity of mobile agent network systems makes it hard to obtain the task route reliability of the MABS theoretically; instead we estimate it using Monte Carlo simulation. In this paper, we assume that the MABS consists of a number of independent mobile agents operating simultaneously. The results we have achieved demonstrate the robustness of the proposed algorithms.