{'fraction_non_alphanumeric': 0.022332506203473945, 'fraction_numerical': 0.004962779156327543, 'mean_word_length': 5.067669172932331, '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}}
An improved algorithm for optimal lightpath establishment on a tree topology

Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelength-division multiplexed (WDM) optical network so as to achieve greater capacity. In a recent paper, Datta et al. studied the problem of establishing a set of disjoint lightpaths on a tree topology using a single wavelength to maximize the total traffic supported by the chosen set of lightpaths. They discussed applications of this problem to RWA and presented a dynamic programming algorithm which optimally solves this problem in Oscr(n4+nDscr3) time, where n is the number of nodes in the network and Dscr is the maximum node degree. In this paper, we present an improved algorithm with a time complexity of Oscr(n2+nDscr2)