{'fraction_non_alphanumeric': 0.03169734151329243, 'fraction_numerical': 0.00408997955010225, 'mean_word_length': 5.2756410256410255, '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}}
Reconfigurable grooming of dynamic traffic in SONET/WDM ring networks

Traffic grooming is one of the most important problems in optical networks with high scientific and commercial value. Efficient grooming of traffic can not only effectively reduce the network's cost but also optimize its performance. To deal with the grooming of changing traffic in SONET/WDM rings, we classified it into the following two types: (1) reconfigurable grooming of deterministic dynamic traffic (REGDT); (2) reconfigurable grooming of non-deterministic dynamic traffic (REGNT). Two types of REGNT are studied, and two cases (best-fit and full-fit) for handling it were proposed in this paper. Further more, two heuristic algorithms, GA1 and GA2, which combine genetic algorithm with traffic-splitting heuristics, were developed to deal with each case. Computer simulations showed that the algorithms proposed in this paper can achieve much better results than previous ones for these two cases.