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.55613641378Broder, A.Z., Mitzenmacher, M., Network applications of Bloom filters: A survey (2003) Internet Math, 1 (4)Bloom, B.H., Space/time trade-offs in hash coding with allowable errors (1970) Commun. ACM, 13 (7), pp. 422-426Cai, H., Ge, P., Wang, J., Applications of Bloom filters in peer-to-peer systems: Issues and questions (2008) NAS'08: Proceedings of the 2008 International Conference on Networking, Architecture, and Storage, pp. 97-103. , Washington, DC, USAHebden, P., Pearce, A., Data-centric routing using Bloom filters in wireless sensor networks (2006) Fourth International Conference on Intelligent Sensing and Information Processing (ICISIP-06), pp. 72-78Wolf, T., Data path credentials for high-performance capabilities-based networks (2008) ANCS'08: Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, pp. 129-130. , ACM New York, NY, USAYe, F., Luo, H., Lu, S., Zhang, L., Member, S., Statistical en-route filtering of injected false data in sensor networks (2004) INFOCOM, pp. 839-850Ratnasamy, S., Ermolinskiy, A., Shenker, S., Revisiting IP multicast (2006) Proceedings of ACM SIGCOMM'06, , Pisa, ItalyJokela, P., Zahemszky, A., Esteve, C., Arianfar, S., Nikander, P., LIPSIN: Line speed publish/subscribe inter-networking (2009) Proceedings of ACM SIGCOMM'09, , Barcelona, SpainLaufer, R.P., Velloso, P.B., Cunha, D.D.O., Moraes, I.M., Bicudo, M.D.D., Moreira, M.D.D., Duarte, O.C.M.B., Towards stateless single-packet IP traceback (2007) The 32nd IEEE Conference on Local Computer Networks (LCN'07), pp. 548-555. , Washington, DC, USAWhitaker, A., Wetherall, D., Forwarding without loops in icarus (2002) Proceedings of OPENARCH 2002Aura, T., Nikander, P., Stateless connections (1997) Lecture Notes in Computer Science, (1334), pp. 87-97Rothenberg, C.E., Towards a new generation of information-oriented internetworking architectures (2008) First Workshop on Re-Architecting the Internet, , Madrid, SpainBose, P., Guo, H., Kranakis, E., Maheshwari, A., Morin, P., Morrison, J., Smid, M., Tang, Y., On the false-positive rate of Bloom filters (2008) Inf. Process. Lett., 108 (4), pp. 210-213Lumetta, S., Mitzenmacher, M., Using the power of two choices to improve Bloom filters (2007) Internet Math., 4 (1), pp. 17-33Jimeno, M., Christensen, K., Roginsky, A., A power management proxy with a new best-of-N bloom filter design to reduce false positives (2007) Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference, pp. 125-133. , DOI 10.1109/PCCC.2007.358887, 4197923, 27th IEEE International Performance Computing and Communications Conference, IPCCC 07Kirsch, A., Mitzenmacher, M., Less hashing, same performance: Building a better bloom filter (2006) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 456-467. , 4168 LNCS, Algorithms, ESA 2006 - 14th Annual European Symposium, ProceedingsBonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., Varghese, G., An improved construction for counting Bloom filters (2006) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 684-695. , 4168 LNCS, Algorithms, ESA 2006 - 14th Annual European Symposium, ProceedingsGoh, E.-J., Secure indexes, Cryptology ePrint archive (2003) Report 2003/216, , http://eprint.iacr.org/2003/216/Hwang, D., Chaney, M., Karanam, S., Ton, N., Gaj, K., Comparison of FPGA-targeted hardware implementations of eSTREAM stream cipher candidates (2008) SASC'08, , http://mason.gmu.edu/dhwang/pdf/2008eSTREAM.pdf, FebruaryRothenberg, C., Jokela, P., Nikander, P., Sarela, M., Ylitalo, J., Self-routing denial-of-service resistant capabilities using in-packet Bloom filters (2009) 5th European Conference on Computer Network Defense (EC2ND), pp. 46-51Särelä, M., BloomCasting: Security in Bloom filter based multicast (2010) Lecture Notes in Computer Science, , Springer, NordSecHenke, C., Schmoll, C., Zseby, T., Empirical evaluation of hash functions for multipoint measurements (2008) SIGCOMM Comput. Commun. Rev., 38 (3), pp. 39-50Mitzenmacher, M., Vadhan, S., Why simple hash functions work: Exploiting the entropy in a data stream (2008) SODA'08: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 746-755. , Society for Industrial and Applied Mathematics Philadelphia, PA, USAHao, F., Kodialam, M., Lakshman, T.V., Building high accuracy bloom filters using partitioned hashing (2007) Performance Evaluation Review, 35 (1), pp. 277-288. , DOI 10.1145/1269899.1254916, SIGMETRICS'07 - Proceedings of the 2007 International Conference on Measurement and Modeling of Computer SystemsLu, Y., Prabhakar, B., Bonomi, F., Bloom filters: Design innovations and novel applications (2005) 43rd Annual Allerton ConferenceNojima, R., Kadobayashi, Y., Cryptographically secure bloom-filters (2009) Trans. Data Privacy, 2 (2), pp. 131-139Rothenberg, C.E., Data center networking with in-packet bloom filters (2010) SBRC 2010MacApuna, C.A.B., In-packet Bloom filter based data center networking with distributed OpenFlow controllers (2010) IEEE International Workshop on Management of Emerging Networks and Services (IEEE MENS 2010), , Miami, Florida, USASärelä, M., Forwarding anomalies in Bloom filter based multicast (2011) INFOCOM, , Shanghai, China accepted for publicationSärelä, M., Ott, J., Ylitalo, J., Fast inter-domain mobility with in-packet Bloom filters (2010) MobiArch'10: Proceedings of the Fifth ACM International Workshop on Mobility in the Evolving Internet Architecture, pp. 9-14. , ACM New York, NY, USAZahemszky, A., Jokela, P., Sarela, M., Ruponen, S., Kempf, J., Nikander, P., MPSS: Multiprotocol Stateless Switching (2010) Global Internet Symposium 2010, pp. 1-6Rothenberg, C.E., MacApuna, C.A.B., Verdi, F., Magalhães, M., The deletable Bloom filter: A new member of the Bloom family (2010) IEEE Commun. Lett., 14 (6), pp. 557-559