{'fraction_non_alphanumeric': 0.023287671232876714, 'fraction_numerical': 0.0027397260273972603, 'mean_word_length': 5.301724137931035, '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}}
End-to-End Service Deployment Using Graph Matching Search for B5G/6G Networks

Decomposing complex network services into fine-grained tasks can make full use of distributed network resources to meet service needs. However, there is a lack of research on end-to-end fine-grained service deployment taking network topologies and location constraints into account. In this paper, we construct a service deployment model with task dependencies, model the service deployment problem as a relaxed subgraph isomorphism problem, and propose a graph matching search strategy to solve it. Simulation results show that the proposed strategy can effectively reduce the average end-to-end delay of services while ensuring resource constraints.