{'fraction_non_alphanumeric': 0.022594142259414227, 'fraction_numerical': 0.0, 'mean_word_length': 5.644444444444445, '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}}
Disjoint paths pair computation procedure for SDH/SONET networks

The increasing demand for bandwidth and the error-prone, costly, and long-lasting service provisioning process force carriers to find new ways of automatic service provisioning. Despite the introduction of numerous path computation procedures, suitable for WDM-technology-based networks, very few studies exist that discusses the SDH/SONET specific multiplexing requirements. Furthermore, the existing disjoint path computation procedures do not always find the best possible path between two nodes. In this paper, we propose a path computation procedure capable of addressing the SDH/SONET multiplexing requirements and the shortcomings of the existing disjoint path computation procedures. Our disjoint paths pair computation procedure is applied to the topology of the NSF.net network. The simulation results, obtained with Matlab, suggest that the proposed procedure outperforms existing path computation procedures. The proposed procedure covers the demand for bandwidth with fewer resources. Furthermore, it finds paths considering the capacity units of SDH/SONET. It is also observed that the time complexity is tolerable.