{'fraction_non_alphanumeric': 0.0225705329153605, 'fraction_numerical': 0.0, 'mean_word_length': 5.461538461538462, '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}}
Terminal-pair reliability in ATM virtual path networks

Terminal-pair reliability (TR) in an asynchronous transfer mode (ATM) virtual path (VP) network corresponds to probabilistic quantization of robustness between two VP terminators, given a VP layout and failure probabilities of physical links. Existing TR algorithms are not viable for ATM VP networks owing to either high complexity or failure dependency among the VPs. The paper proposes two efficient algorithms for TR computation between two VP terminators by means of variants of path-based and cut-based partition methods which have been effectively used for TR computation in traditional networks. The first variant, called the path-based virtual path reliability (PVPR) algorithm, partitions the search space based on a physical path embedding the shortest route of VPs from the source to the destination terminator. The second variant, called the cut-based virtual path reliability (CVPR) algorithm, in lieu, performs the partition on the basis of a physical cutset separating the source from the remaining terminators. In both algorithms, each subproblem is recursively processed by means of partition until the source and destination terminators are contracted or disconnected. Experimental results reveal that, CVPR outperforms PVPR with respect to computation time. Moreover, compared to one of the most promising TR algorithms, both CVPR and PVPR exhibit superior performance. The two algorithms and their promising results consequently facilitate the real-time computation of the reliability or robustness of ATM VP networks.