{'fraction_non_alphanumeric': 0.01134020618556701, 'fraction_numerical': 0.0, 'mean_word_length': 5.031055900621118, '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}}
Virtual Grid System Based on a Minimum Spanning Tree Algorithm

This paper describes the formation structure of a dynamic virtual GRID system that is built on the basis of the minimum spanning tree algorithm which increase the efficiency of GRID-system by presenting it in a dynamic virtual GRID system. Moreover, we develop a distributed routing algorithm that produces routing tables based on the routing agents located at the nodes of virtual GRID-systems. In addition to a comparative analysis of the proposed formation of the GRID system, we propose a new algorithm for constructing spanning tree for the DV GRID that adapts to the dynamics of the changeable environment and forms the tree based on the vertex with maximum degree. Our results clearly show the superiorities of the proposed algorithm over available algorithms in terms of performance and resource allocation. To create routing tables and virtual GRID-systems forming, we have used GridSim simulator.