{'fraction_non_alphanumeric': 0.009592326139088728, 'fraction_numerical': 0.0035971223021582736, 'mean_word_length': 4.921985815602837, '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}}
Ant Colony Optimization Technique Applied in Network Routing Problem

In this paper, the Ant Colony Optimization Technique has been applied in different network models with different number of nodes and structure to find the shortest path with optimum throughput. Three variations of the Ant Colony Optimization Technique, ACO1, ACO2 and ACO3 has been proposed and applied on different standard network models and the results has been analyzed and concluded. A Tabu list is also maintained for a network with large number of nodes and results were collected to find the optimum size of the Tabu list in one of the algorithms proposed here. Experiments have also been performed by varying the load of the network. Here the throughput and the reliability of the network has been specially taken as the performance factor of the network.