{'fraction_non_alphanumeric': 0.032196969696969696, 'fraction_numerical': 0.0, 'mean_word_length': 5.04, '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}}
Finding Good Candidate Node-Encircling Pre-configuration Cycles in Survivable WDM Mesh Networks

A fault recovery system that is fast and reliable is essential in survivability design in wavelength-division-multiplexing (WDM) mesh networks. Pre-configuration cycle (p-cycle) benefits both the fast recovery time and the efficient resource utilization. Finding good candidate p-cycles is the first and very important step in p-cycle design. The node-encircling p-cycle can protect not only the on-cycle links and the straddling links but also the central node and the straddling flows. In this paper, we present a novel algorithm, called the Node-encircling p-cycles mining algorithm (NCMA), to efficiently find good candidate node-encircling p-cycles. The qualities of p-cycles generated by our algorithm are controlled by several input parameters. The algorithm is also suitable for finding some special link p-cycles which must contain some fixed nodes. Finally, the performance of the algorithm is gauged by running on some real world network topologies