{'fraction_non_alphanumeric': 0.013921113689095127, 'fraction_numerical': 0.0, 'mean_word_length': 5.810526315789474, '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}}
Modeling Reliability Requirements in Coordinated Node and Link Mapping

High performance systems require high levels of reliability. Many functions involved in telecommunication and IT networks have reliability requirements that can only be achieved by introducing redundant resources. In the telecom sector, recently, there has been a significant effort on moving carrier grade systems and functions to virtualized network infrastructure. The management and coordination of those virtualized systems to achieve an optimal mapping (or embedding) to the physical resources that host them is known as virtual resource orchestration. In our prior work we introduced a novel model, based on Mixed Integer Programming (MIP) problem formulation, as one significant way of achieving this optimality in embedding. This paper extends the model to include reliability requirements, improving prior art techniques as well as implementing a novel approach, denoted as reliability assurance. The confidence of the target reliability of the embedded virtual graphs can be traded with the efficiency of the substrate utilization. Extensive simulation results show that our model provides embedding rates and infrastructure utilization comparable with prior art while fulfilling high reliability requirements.