Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 2004 Working Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 2004 Working Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Design and analysis of an efficient distributed event notification service

      Bittner, Sven; Hinze, Annika
      Thumbnail
      Files
      content.pdf
      355.4Kb
      Citation
      Export citation
      Bittner, S., & Hinze, A. (2004). Design and analysis of an efficient distributed event notification service. (Working paper series. University of Waikato, Department of Computer Science. No. 11/2004). Hamilton, New Zealand: University of Waikato.
      Permanent Research Commons link: https://hdl.handle.net/10289/100
      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.
      Date
      2004-01-01
      Type
      Working Paper
      Publisher
      Department of Computer Science, University of Waikato
      Collections
      • 2004 Working Papers [14]
      Show full item record  

      Usage

      Downloads, last 12 months
      16
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement