{'fraction_non_alphanumeric': 0.01938610662358643, 'fraction_numerical': 0.0, 'mean_word_length': 5.391752577319588, '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}}
Dijkstra's Algorithm Model over MPLS / GMPLS

the increased use of virtual connections in packet switched networks, in particular over the Internet, using MPLS and GMPLS evolution has produced a significant amount of studies on traffic engineering protocols, especially with regard to the different ways to provide quality of service over connections. This article presents a model to characterize the reliability of these types of networks, in computing restricted route domain. With these elements, an application is proposed, to establish virtual connections with likely default reliability on MPLS / GMPLS networks.