{'fraction_non_alphanumeric': 0.02736318407960199, 'fraction_numerical': 0.0008291873963515755, 'mean_word_length': 4.802884615384615, '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}}
Many-to-Many Traffic Grooming in WDM Mesh Networks

In many-to-many communication, a session consists of group of users (we call them members) where each one of the members transmits its traffic to all other members in the group. This paper studies the problem of provisioning many- to-many sessions with sub-wavelength granularities in WDM mesh networks. Our objective is to minimize the number of transceivers required. We study the problem in networks with and without optical splitting capabilities. For networks without optical splitting capabilities, we use an optimal approach which is an extension of that introduced in [8] for the many-to-one traffic grooming problem. For networks with optical splitting capabilities, we introduce a novel hub-based approach where each session is routed through a many-to-one tree from the members to a central hub node, and then through a multicast tree from the hub node back to the members. At the hub node, network coding is performed by linearly combining the traffic units received from the members. These combinations are then groomed and delivered back to the members using light-tree(s). Numerical results from both approaches are presented and compared.