{'fraction_non_alphanumeric': 0.013980263157894737, 'fraction_numerical': 0.0, 'mean_word_length': 5.439153439153439, '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}}
A virtual network embedding algorithm based on the connectivity of residual substrate network

As virtualization is becoming a promising way to support various emerging application, efficient virtual network embedding (VNE) algorithm is becoming more and more important. In this paper, we investigate the VNE problem from a new perspective. We propose two concepts of strongly connected graph and weakly connected graph in undirected graph witch are similar to the concepts in directed graph. With the arrival of VN requests, the connectivity of residual substrate network becomes smaller and smaller and the residual substrate network is divided into several strongly connected graphs. And there are weak connections among these strongly connected graphs. Then, we embed each VN request onto each strongly connected graphs with load balancing. Load balancing could avoid blocked or bottlenecked area of substrate network. Simulation experiments show compared with other algorithms in large-scale network, acceptance ratio and revenue can be obviously improved and cost can be reduced by our algorithm. It also show the relationship between the connectivity of residual substrate network and the performance metrics.