{'fraction_non_alphanumeric': 0.014964788732394365, 'fraction_numerical': 0.0, 'mean_word_length': 5.6104651162790695, '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}}
Resource Optimization for Web Service Composition

Service composition recently emerged as a costeffective way to quickly create new services within a network. Some research has been done to support user perceived end-toend QoS for service composition. However, not much work has been done to improve anetwork operator’sperformance when deploying composite services. In this paper we develop a service composition architecture that optimizes the aggregate bandwidth utilization within a operator’s network; this metric is what operators care about most. A general service composition graph is proposed to model the loosely coupled interaction among service components as well as the estimated traffic that flows among them. Then an optimization problem is formalized and proved to be NP-hard, even toapproximate. Next, two polynomial-time heuristic algorithms are developed together with several local search algorithms that further improve the performance of these two algorithms. Our simulations demonstrate the effectiveness of both approximation algorithms and show that they are suitable for service graphs with varying topologies.