{'fraction_non_alphanumeric': 0.024009603841536616, 'fraction_numerical': 0.0012004801920768306, 'mean_word_length': 4.8321678321678325, '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}}
Leader election in Peer-to-Peer systems

This paper considers the problem of electing a leader in dynamic peer-to-peer systems in which nodes behavior in high rate of churn. Usually the leader node is used to coordinate some tasks. Leader election influences on the performance of the system in two stages; the election operation and the result of the election as example leader's ability in making its responsibilities. Because of the Peer-to-Peer systems is high dynamic, it was focus on the first stage in order to elect the leader with high efficient method. So, the proposed algorithm is with complexity O(1). In algorithm, the election operations are dependent only on local knowledge. The correctness of the algorithm is analytically proved and its scalability and efficiency experimentally are evaluated by using simulations.