{'fraction_non_alphanumeric': 0.03156384505021521, 'fraction_numerical': 0.0014347202295552368, 'mean_word_length': 4.768595041322314, '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}}
A Trigger Counting Mechanism for Ring Topology

Consider a distributed system with n processors, which receive triggers from the outside world. The Distributed Trigger Counting (DTC) problem is to raise an alarm if the number of triggers over the system reaches w, which is an user specified input. DTC is used as a primitive operation in many applications, such as distributed monitoring, global snapshot etc. In this paper, we propose an algorithm for the DTC problem in a ring topology with a message complexity of O(n2 log(w/n)) and each node in the system receives O(n log(w/n)) number of messages. We also discuss about the possible tuning of the algorithm which results better complexities.