Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: In-packet Bloom Filters: Design And Networking Applications
Author: Rothenberg C.E.
MacApuna C.A.B.
Magalhaes M.F.
Verdi F.L.
Wiesmaier A.
Abstract: The Bloom filter (BF) is a well-known randomized data structure that answers set membership queries with some probability of false positives. In an attempt to solve many of the limitations of current network architectures, some recent proposals rely on including small BFs in packet headers for routing, security, accountability or other purposes that move application states into the packets themselves. In this paper, we consider the design of such in-packet Bloom filters (iBF). Our main contributions are exploring the design space and the evaluation of a series of extensions (1) to increase the practicality and performance of iBFs, (2) to enable false-negative-free element deletion, and (3) to provide security enhancements. In addition to the theoretical estimates, extensive simulations of the multiple design parameters and implementation alternatives validate the usefulness of the extensions, providing for enhanced and novel iBF networking applications. © 2010 Elsevier B.V. All rights reserved.
Rights: fechado
Identifier DOI: 10.1016/j.comnet.2010.12.005
Date Issue: 2011
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
2-s2.0-79953777367.pdf1.33 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.