{'fraction_non_alphanumeric': 0.01768172888015717, 'fraction_numerical': 0.0029469548133595285, 'mean_word_length': 5.13855421686747, '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}}
An Improved Genetic Algorithm for Cost-Delay-Jitter QoS Multicast Routing

In this paper, an improved genetic algorithm is presented to solve the multicast routing problem, which is known as NP-complete problem. The contribution of this work includes: (1) the adaptive niche technique and new migration rules are designed to improve the performance of genetic algorithm. (2) In order to fulfil the adaptability of the basic operators of genetic algorithm, the artificial immune system is involved to dynamically control the crossover operator and the mutation operator. (3) A tree encoding based on the theory of generating the spanning tree is proposed to map the solution space of the multicast tree of QoS multicast routing problem, which basic definitions and axioms of the topology are described especially the character of spanning tree and the nature of the cut edge and cut set of a tree. Experiment result shows that this improved genetic algorithm has higher accuracy and performance than traditional methods