{'fraction_non_alphanumeric': 0.022530329289428077, 'fraction_numerical': 0.006932409012131715, 'mean_word_length': 5.4222222222222225, '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}}
Bounds on Optical Bandwidth Allocation on Directed Fiber Tree Topologies

In this paper, we address the issue of efficiently allocating wavelengths to communication requests in wavelength division multiplexing (WDM) optical networks. We present a simple greedy algorithm and study its performance on directed binary fiber trees. We prove that our algorithm guarrantees a 5=3-approximationfor wavelengths assignment in binary tree shaped WDM optical networks. We also prove that no greedy algorithm can go below the ratio of 5=3, even for the case of leaf–to–leaf communication.