Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

A Distributed Algorithm for Finding Global Icebergs with Linked Counting Bloom Filters

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Kui Wu ; Comput. Sci. Dept., Univ. of Victoria, Victoria, BC ; Yang Xiao ; Jie Li ; Bo Sun

Icebergs denote data items whose total frequency of occurrence is greater than a given threshold. When data items are scattered across a large number of network nodes, searching for global icebergs becomes a challenging task especially in bandwidth limited wireless networks. Existing solutions require a central server for ease of algorithm design and/or use random sampling to reduce bandwidth cost. In this paper, we present a new distributed algorithm to search for global icebergs without any centralized control or random sampling. A new type of Bloom filter, called linked counting Bloom filter, is designed to check the membership of a set and to store the accumulative frequency of data items. We evaluate the performance of our distributed algorithm with real data sets.

Published in:

Communications, 2008. ICC '08. IEEE International Conference on

Date of Conference:

19-23 May 2008