Adaptive Bloom filters for multicast addressing

Zalan Heszberger, Janos Tapolcai, Andras Gulyas, Jozsef Biro, Andras Zahemszky, Pin Han Ho

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

In-packet Bloom filters are recently proposed as a possible building block of future Internet architectures replacing IP or MPLS addressing that solves efficient multicast routing, security and other functions in a stateless manner. In such frameworks a bloom filter is placed in the header which stores the addresses of the destination nodes or the traversed links. In contrast to the standard Bloom filter, the length of the in-packet Bloom filter must be highly adaptive to the number of stored elements to achieve low communication overhead. In this paper we propose a novel type of Bloom filter called Adaptive Bloom filter, which can adapt its length to the number of elements to be represented with a very fine granularity. The novel filter can significantly reduce the header size for in-packet bloom filter architecture, by eliminating the wasting effect experienced in existing block-based approaches which rely on concatenating several standard Bloom filters. Nevertheless, it requires slightly more calculations when adding and removing elements.

Original languageEnglish
Title of host publication2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011
Pages174-179
Number of pages6
DOIs
Publication statusPublished - Jul 26 2011
Event2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011 - Shanghai, China
Duration: Apr 10 2011Apr 15 2011

Publication series

Name2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011

Other

Other2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011
CountryChina
CityShanghai
Period4/10/114/15/11

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

Fingerprint Dive into the research topics of 'Adaptive Bloom filters for multicast addressing'. Together they form a unique fingerprint.

  • Cite this

    Heszberger, Z., Tapolcai, J., Gulyas, A., Biro, J., Zahemszky, A., & Ho, P. H. (2011). Adaptive Bloom filters for multicast addressing. In 2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011 (pp. 174-179). [5928802] (2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011). https://doi.org/10.1109/INFCOMW.2011.5928802