{'fraction_non_alphanumeric': 0.018326693227091632, 'fraction_numerical': 0.0, 'mean_word_length': 4.980952380952381, '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}}
Policy-Compliant Search Query Routing for Web Service Discovery in Peer to Peer Networks

Web services are increasingly hosted on peer to peer networks, to facilitate resource sharing and cooperation. In these settings, each peer hosts a set of services which can be invoked by other peers of the network through a service query. In a pure peer to peer network, it might not be possible to maintain directory for publishing the services, rather, the peers need to search for the required service through query forwarding in the network. For such non-directory based peer to peer networks, in this paper, we introduce an efficient and fully decentralized policy-compliant search query routing method for service discovery. Our main goal is to protect the search query from traversing unwanted peers in the network, while achieving service discovery. To this end, we design and develop a policy-driven approach that allows distributed searches through service queries taking into account any security, routing or other functional criteria a peer may have with respect to routing a query. We have developed a prototype of the query protection and search protocol, and tested it on large networks. Our tests demonstrate accuracy and efficient execution times.