Event dissemination via group-aware stream filtering

We consider a distributed system that disseminates highvolume event streams to many simultaneous monitoring applications over a low-bandwidth network. For bandwidth efficiency, we propose a group-aware stream filtering approach, used together with multicasting, that exploits two overlooked, yet important, properties of monitoring applications: 1) many of them can tolerate some degree of "slack" in their data quality requirements, and 2) there may exist multiple subsets of the source data satisfying the quality needs of an application. We can thus choose the "best alternative" subset for each application to maximize the data overlap within the group to best benefit from multicasting. We provide a general framework that treats the group-aware stream filtering problem completely; we prove the problem NP-hard and thus provide a suite of heuristic algorithms that ensure data quality (specifically, granularity and timeliness) while preserving bandwidth. Our evaluation sh...

• Type: Conference
• Year: 2008
• Where: DEBS
• Authors: Ming Li, David Kotz
• Keywords: DEBS 2008, Distributed And Parallel Computing, Group-aware Stream Filtering, Monitoring Applications, Stream Filtering Approach