{'fraction_non_alphanumeric': 0.016648168701442843, 'fraction_numerical': 0.0, 'mean_word_length': 5.731343283582089, '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}}
Optimal itinerary planning for mobile agents-based management

Proposed management architectures, incorporating mobile agent (MA) technology, fail to address scalability problems, when monitoring tasks employing multi-hop agents are considered. This is because they lack mechanisms, which can guarantee that the agents itinerary is optimised so as to minimise migration traffic and round-trip latency. Herein, we propose an algorithm that adapts methods usually applied for addressing network design problems in the problematic of MA itinerary planning. The algorithm not only suggests the optimal number of MAs that minimise the overall cost but also constructs optimal itineraries for each of them. The algorithm implementation has been integrated into our MA framework research prototype while its validity and competence has been verified through simulation results over large enterprise networks.