Design and analysis of an efficient distributed event notification service

Abstract

Event Notification Services (ENS) use the publish/subscribe paradigm to continuously inform subscribers about events they are interested in. Subscribers define their interest in so-called profiles. The event information is provided by event publishers, filtered by the service against the profiles, and then send to the subscribers. In real-time systems such as facility management, an efficiency filter component is one of the most important design goals. In this paper, we present our analysis and evaluation of efficient distributed filtering algorithms. Firstly, we propose a classification and first-cut analysis of distributed filtering algorithms. Secondly, based on the classification we describe our analysis of selected algorithms. Thirdly, we describe our ENS prototype DAS that includes three filtering algorithms. This prototype is tested with respect to efficiency, network traffic and memory consumption. In this paper, we discuss the results of our practical analysis in detail.