{'fraction_non_alphanumeric': 0.026427962489343565, 'fraction_numerical': 0.005115089514066497, 'mean_word_length': 4.811881188118812, '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}}
Peer-to-Peer contents delivery system considering network distance

Network traffic on the Internet has been increasing in recent years. Some reports by government institutions indicate that Peer-to-Peer (P2P) traffic consumes 30% of network bandwidth on the Internet. In most current P2P file-sharing software, computers, which are called "peer" get files not only from computers that are nearby on the network but also from those that are far away. This is because the computers do not consider the relative location of other computers on the Internet. We regard Round Trip Time (RTT) or Time To Live (TTL) as the network distance and design a new P2P content delivery system. In this system, to decrease waste, peers on the P2P file-sharing network prioritize nearby peers when obtaining files. Peers search for other peers that have desired files using clusters, based on network distance and trend of contents which a peer has. Peers search for popular files from other peers in distance-based clusters and search for less popular files from peers in trend-based clusters. Simulation results indicate our system facilitates a reduction in traffic in the whole network.