Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding

J. Tapolcai, József Bíró, Péter Babarczi, András Gulyás, Zalán Heszberger, Dirk Trossen

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Large-scale information dissemination in multicast communications has been increasingly attracting attention, be it through uptake in new services or through recent research efforts. In these, the core issues are supporting increased forwarding speed, avoiding state in the forwarding elements, and scaling in terms of the multicast tree size. This paper addresses all these challenges - which are crucial for any scalable multicast scheme to be successful - by revisiting the idea of in-packet Bloom filters and source routing. As opposed to the traditional in-packet Bloom filter concept, we build our Bloom filter by enclosing limited information about the structure of the tree. Analytical investigation is conducted and approximation formulas are provided for optimal-length Bloom filters, in which we got rid of typical Bloom filter illnesses such as false-positive forwarding. These filters can be used in several multicast implementations, which are demonstrated through a prototype. Thorough simulations are conducted to demonstrate the scalability of the proposed Bloom filters compared to its counterparts.

Original languageEnglish
Article number6877748
Pages (from-to)1832-1845
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume23
Issue number6
DOIs
Publication statusPublished - Dec 1 2015

Fingerprint

Information dissemination
Scalability
Communication

Keywords

  • Bloom filter
  • information-centric networking
  • multicast addressing
  • source routing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Software
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding. / Tapolcai, J.; Bíró, József; Babarczi, Péter; Gulyás, András; Heszberger, Zalán; Trossen, Dirk.

In: IEEE/ACM Transactions on Networking, Vol. 23, No. 6, 6877748, 01.12.2015, p. 1832-1845.

Research output: Contribution to journalArticle

Tapolcai, J, Bíró, J, Babarczi, P, Gulyás, A, Heszberger, Z & Trossen, D 2015, 'Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding', IEEE/ACM Transactions on Networking, vol. 23, no. 6, 6877748, pp. 1832-1845. https://doi.org/10.1109/TNET.2014.2342155
Tapolcai, J. ; Bíró, József ; Babarczi, Péter ; Gulyás, András ; Heszberger, Zalán ; Trossen, Dirk. / Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding. In: IEEE/ACM Transactions on Networking. 2015 ; Vol. 23, No. 6. pp. 1832-1845.
@article{61fbbb74844f4fb6bda54034de3b4bc5,
title = "Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding",
abstract = "Large-scale information dissemination in multicast communications has been increasingly attracting attention, be it through uptake in new services or through recent research efforts. In these, the core issues are supporting increased forwarding speed, avoiding state in the forwarding elements, and scaling in terms of the multicast tree size. This paper addresses all these challenges - which are crucial for any scalable multicast scheme to be successful - by revisiting the idea of in-packet Bloom filters and source routing. As opposed to the traditional in-packet Bloom filter concept, we build our Bloom filter by enclosing limited information about the structure of the tree. Analytical investigation is conducted and approximation formulas are provided for optimal-length Bloom filters, in which we got rid of typical Bloom filter illnesses such as false-positive forwarding. These filters can be used in several multicast implementations, which are demonstrated through a prototype. Thorough simulations are conducted to demonstrate the scalability of the proposed Bloom filters compared to its counterparts.",
keywords = "Bloom filter, information-centric networking, multicast addressing, source routing",
author = "J. Tapolcai and J{\'o}zsef B{\'i}r{\'o} and P{\'e}ter Babarczi and Andr{\'a}s Guly{\'a}s and Zal{\'a}n Heszberger and Dirk Trossen",
year = "2015",
month = "12",
day = "1",
doi = "10.1109/TNET.2014.2342155",
language = "English",
volume = "23",
pages = "1832--1845",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding

AU - Tapolcai, J.

AU - Bíró, József

AU - Babarczi, Péter

AU - Gulyás, András

AU - Heszberger, Zalán

AU - Trossen, Dirk

PY - 2015/12/1

Y1 - 2015/12/1

N2 - Large-scale information dissemination in multicast communications has been increasingly attracting attention, be it through uptake in new services or through recent research efforts. In these, the core issues are supporting increased forwarding speed, avoiding state in the forwarding elements, and scaling in terms of the multicast tree size. This paper addresses all these challenges - which are crucial for any scalable multicast scheme to be successful - by revisiting the idea of in-packet Bloom filters and source routing. As opposed to the traditional in-packet Bloom filter concept, we build our Bloom filter by enclosing limited information about the structure of the tree. Analytical investigation is conducted and approximation formulas are provided for optimal-length Bloom filters, in which we got rid of typical Bloom filter illnesses such as false-positive forwarding. These filters can be used in several multicast implementations, which are demonstrated through a prototype. Thorough simulations are conducted to demonstrate the scalability of the proposed Bloom filters compared to its counterparts.

AB - Large-scale information dissemination in multicast communications has been increasingly attracting attention, be it through uptake in new services or through recent research efforts. In these, the core issues are supporting increased forwarding speed, avoiding state in the forwarding elements, and scaling in terms of the multicast tree size. This paper addresses all these challenges - which are crucial for any scalable multicast scheme to be successful - by revisiting the idea of in-packet Bloom filters and source routing. As opposed to the traditional in-packet Bloom filter concept, we build our Bloom filter by enclosing limited information about the structure of the tree. Analytical investigation is conducted and approximation formulas are provided for optimal-length Bloom filters, in which we got rid of typical Bloom filter illnesses such as false-positive forwarding. These filters can be used in several multicast implementations, which are demonstrated through a prototype. Thorough simulations are conducted to demonstrate the scalability of the proposed Bloom filters compared to its counterparts.

KW - Bloom filter

KW - information-centric networking

KW - multicast addressing

KW - source routing

UR - http://www.scopus.com/inward/record.url?scp=84961928003&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84961928003&partnerID=8YFLogxK

U2 - 10.1109/TNET.2014.2342155

DO - 10.1109/TNET.2014.2342155

M3 - Article

AN - SCOPUS:84961928003

VL - 23

SP - 1832

EP - 1845

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 6

M1 - 6877748

ER -