{'fraction_non_alphanumeric': 0.028358208955223882, 'fraction_numerical': 0.013432835820895522, 'mean_word_length': 5.155963302752293, '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}}
Storage and retrieval on P2P networks: A DHT based protocol

In this paper we present the development, implementation and simulation of a simple Distributed Hash Table (DHT) protocol for a Peer to peer (P2P) overlay network inspired by small world [3, 2] concepts. Our simulation and implementation, done on the Peersim [10] Java network simulator, showed results consistent with other state of the art DHT implementations with a more simple and pragmatic approach for the graph construction algorithm. We present the results of simulating this protocol on large P2P networks and compare them with the results obtained in Symphony [14], another small world inspired DHT.