{'fraction_non_alphanumeric': 0.024771838331160364, 'fraction_numerical': 0.0, 'mean_word_length': 5.193548387096774, '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}}
A distributed tree algorithms for WDM network protection/restoration

High-speed optical networks need efficient protectionhestoration schemes. A heuristic distributed MST algorithm, called the Pick-up-Parent (PUP) Algorithm, is proposed in this paper. A node would activate this algorithm after receiving a special message, called a pick-up-parent message, in order to form a logical spanning tree for network protection. The restoration strategy for this tree network protection lies in two points: Using tree links to protect nontree links, and seeking a shortest path from a node to its parent in order to protect the corresponding tree link. Performance analysis of the algorithm executed in some topologies based on existing networks is presented in this paper.