{'fraction_non_alphanumeric': 0.012810248198558846, 'fraction_numerical': 0.006405124099279423, 'mean_word_length': 5.038647342995169, '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}}
Mobile NodeID based P2P algorithm for the heterogeneous network

A lot of research papers discussed the distributed hash table (DHT) based p2p algorithms to promise that idle resources may be efficiently harvested. However, p2p systems are composed of components with extremely heterogeneous availabilities and to handle churn, the system will generate the heavy information maintenance traffic to keep the efficiency of the DHT based p2p algorithms. In this paper, we suggest the mobile ID based p2p algorithm to reduce the overhead by exploiting the heterogeneity of participant nodes efficiently. Unlike the DHT based p2p algorithms, the node ID of a node changes according to its characteristic to support the p2p system efficiency and each nodes takes the different responsibility in accordance with its node ID. We classify nodes into the two types according to the characteristics of nodes : the reliable nodes and the leaf nodes. The reliable node has the load-balanced ID to balance the loads and the leaf nodes has the load-free ID to reduce the responsibility. We examine the efficiency of our p2p algorithm via a event driven simulation and show that the information maintenance traffic reduces and the routing process is more efficient.