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
      • Computing and Mathematical Sciences Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Classification and analysis of distributed event filtering algorithms

      Bittner, Sven; Hinze, Annika
      DOI
       10.1007/978-3-540-30468-5_20
      Link
       www.springerlink.com
      Find in your library  
      Citation
      Export citation
      Bittner, S. & Hinze, A.(2004). Classification and analysis of distributed event filtering algorithms. In Proceedings of the OTM Confederated International Conferences, CoopIS, DOA, and ODBASE 2004, Agia Napa, Cyprus, October 25-29, 2004.(pp. 301-318). Berlin: Springer.
      Permanent Research Commons link: https://hdl.handle.net/10289/1403
      Abstract
      Publish/subscribe middleware provides efficient support for loosely coupled communication in distributed systems. A number of different distributed message-filtering algorithms have been proposed. So far, a systematic comparison and analysis of these filter algorithms is still missing.

      This paper proposes a classification scheme for distributed filter algorithms that supports the theoretical and practical analysis of these algorithms. We present a first cut theoretical evaluation and a subsequent practical evaluation of promising candidate algorithms. Factors that are considered include the characteristics of the underlying network and application-related constraints.

      Based on the findings of these evaluations, we conclude with a summary of the strengths and weaknesses of the algorithms that we have studied.
      Date
      2004
      Type
      Conference Contribution
      Publisher
      Springer, Berlin
      Collections
      • Computing and Mathematical Sciences Papers [1454]
      Show full item record  

      Usage

       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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