{'fraction_non_alphanumeric': 0.017267267267267267, 'fraction_numerical': 0.0, 'mean_word_length': 5.835897435897436, '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}}
CONTENT-BASED EVENT ROUTING WITH FILTER PROPAGATION

OF THE THESIS Content-Based Event Routing with Filter Propagation by DAN DAVIS Thesis Director: Prof. Manish Parashar Publisher/subscriber is the emerging interaction paradigm in loosely coupled applications due to its inherent scalability. However, addressing the heterogeneity and dynamism in user interest and system state remains a key challenge in publisher/subscriber systems. Existing distributed event systems address these concerns at centralized hubs, at end points, or require flood broadcasted advertisements. Many systems have been implemented and tested on small overlay networks with the hope that the algorithms will scale to larger networks. This thesis presents a distributed routing protocol for a publisher/subscriber event system that uses multicast routing trees to propagate content-based event filters toward the publishers in a widely distributed network. Filter propagation makes this system naturally distributed, efficient, and scalable. Network simulation results demonstrate that the protocol reduces unwanted event traffic and adjusts to changes in subscription and network topology. The compatibility of this protocol with wireless multicast routing protocols, and the minimization and approximation of content-based predicates are also discussed.