{'fraction_non_alphanumeric': 0.034976152623211444, 'fraction_numerical': 0.0, 'mean_word_length': 5.0576923076923075, '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}}
Local-map-based candidate node-encircling pre-configuration cycles construction in survivable mesh networks

This paper studies the protection problem of pre-configuration cycles (p-cycles) in survivable mesh networks. A new algorithm called Local-map-based Finding p-Cycles Algorithm (LFCA) is proposed to find the candidate p-cycles. The major difference between the previous algorithms of finding cycles and LFCA is that LFCA can find node-encircling p-cycles and some special link p-cycles which must contain some fixed nodes. The performance of LFCA is evaluated by computer simulations on the real world network topology. ;