International Journal of Parallel, Emergent and Distributed Systems (IJPEDS)
Department of Computer Science
In this paper we are concerned with disseminating high-volume data streams to many simultaneous applications over a low-bandwidth wireless mesh network. For bandwidth efficiency, we propose a group-aware stream filtering approach, used in conjunction with multicasting, that exploits two overlooked, yet important, properties of these applications: 1) many applications 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. An evaluation of our prototype implementation shows that group-aware data filtering can save bandwidth with low CPU overhead. We also analyze the key factors that affect its performance, based on testing with heterogeneous filtering requirements.
Ming Li and David Kotz. Group-aware Stream Filtering for Bandwidth-efficient Data Dissemination. In International Journal of Parallel, Emergent and Distributed Systems (IJPEDS), December 2008. 10.1080/17445760801930955
Dartmouth Digital Commons Citation
Li, Ming and Kotz, David, "Group-aware Stream Filtering for Bandwidth-efficient Data Dissemination" (2008). Dartmouth Scholarship. 3160.