By Topic

A qualitative method to optimise false positive occurrences for the in-packet Bloom filter forwarding mechanism

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
$33 $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

3 Author(s)
Carrea, L. ; Sch. of Comput. Sci. & Electron. Eng., Univ. of Essex, Colchester, UK ; Almeida, R.C. ; Guild, K.

Bloom filters have been recently proposed as an efficient multicast forwarding mechanism for the information centric topic-based publish/subscribe network proposed within the framework of the PSIRP project. Although such mechanism presents several advantages, as for instance very simple forwarding decisions and small forwarding tables, one of the limitations is the possibility of false positive occurrences during the forwarding decisions. This results in packets to be sent along unexpected links and the consequently wastage of network bandwidth among other effects. Therefore, its frequency must be minimized. One of the crucial points to reduce false positives in Bloom Filters is carefully select the number of hash functions utilized to create them. In this paper, we propose a mathematical analysis of the false positives in the whole network with respect to the number of hash functions. In particular, the number of hash functions correspondent to a minimum of false positive for the whole network is evaluated. Results from the mathematical analysis are compared with numerical analysis.

Published in:

Computer Science and Electronic Engineering Conference (CEEC), 2011 3rd

Date of Conference:

13-14 July 2011