Classification and analysis of distributed event filtering algorithms

6Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Bittner, S., & Hinze, A. (2004). Classification and analysis of distributed event filtering algorithms. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3290, 301–318. https://doi.org/10.1007/978-3-540-30468-5_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free