dc.creatorRothenberg C.E.
dc.creatorMacApuna C.A.B.
dc.creatorMagalhaes M.F.
dc.creatorVerdi F.L.
dc.creatorWiesmaier A.
dc.date2011
dc.date2015-06-30T20:44:10Z
dc.date2015-11-26T14:54:17Z
dc.date2015-06-30T20:44:10Z
dc.date2015-11-26T14:54:17Z
dc.date.accessioned2018-03-28T22:06:10Z
dc.date.available2018-03-28T22:06:10Z
dc.identifier
dc.identifierComputer Networks. , v. 55, n. 6, p. 1364 - 1378, 2011.
dc.identifier13891286
dc.identifier10.1016/j.comnet.2010.12.005
dc.identifierhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79953777367&partnerID=40&md5=f13edf8a375426b9ff9e31d6df76d412
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/109034
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/109034
dc.identifier2-s2.0-79953777367
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1255116
dc.descriptionThe 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.
dc.description55
dc.description6
dc.description1364
dc.description1378
dc.descriptionBroder, A.Z., Mitzenmacher, M., Network applications of Bloom filters: A survey (2003) Internet Math, 1 (4)
dc.descriptionBloom, B.H., Space/time trade-offs in hash coding with allowable errors (1970) Commun. ACM, 13 (7), pp. 422-426
dc.descriptionCai, 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, USA
dc.descriptionHebden, 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-78
dc.descriptionWolf, 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, USA
dc.descriptionYe, F., Luo, H., Lu, S., Zhang, L., Member, S., Statistical en-route filtering of injected false data in sensor networks (2004) INFOCOM, pp. 839-850
dc.descriptionRatnasamy, S., Ermolinskiy, A., Shenker, S., Revisiting IP multicast (2006) Proceedings of ACM SIGCOMM'06, , Pisa, Italy
dc.descriptionJokela, P., Zahemszky, A., Esteve, C., Arianfar, S., Nikander, P., LIPSIN: Line speed publish/subscribe inter-networking (2009) Proceedings of ACM SIGCOMM'09, , Barcelona, Spain
dc.descriptionLaufer, 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, USA
dc.descriptionWhitaker, A., Wetherall, D., Forwarding without loops in icarus (2002) Proceedings of OPENARCH 2002
dc.descriptionAura, T., Nikander, P., Stateless connections (1997) Lecture Notes in Computer Science, (1334), pp. 87-97
dc.descriptionRothenberg, C.E., Towards a new generation of information-oriented internetworking architectures (2008) First Workshop on Re-Architecting the Internet, , Madrid, Spain
dc.descriptionBose, 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-213
dc.descriptionLumetta, S., Mitzenmacher, M., Using the power of two choices to improve Bloom filters (2007) Internet Math., 4 (1), pp. 17-33
dc.descriptionJimeno, 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 07
dc.descriptionKirsch, 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, Proceedings
dc.descriptionBonomi, 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, Proceedings
dc.descriptionGoh, E.-J., Secure indexes, Cryptology ePrint archive (2003) Report 2003/216, , http://eprint.iacr.org/2003/216/
dc.descriptionHwang, 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, February
dc.descriptionRothenberg, 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-51
dc.descriptionSärelä, M., BloomCasting: Security in Bloom filter based multicast (2010) Lecture Notes in Computer Science, , Springer, NordSec
dc.descriptionHenke, C., Schmoll, C., Zseby, T., Empirical evaluation of hash functions for multipoint measurements (2008) SIGCOMM Comput. Commun. Rev., 38 (3), pp. 39-50
dc.descriptionMitzenmacher, 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, USA
dc.descriptionHao, 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 Systems
dc.descriptionLu, Y., Prabhakar, B., Bonomi, F., Bloom filters: Design innovations and novel applications (2005) 43rd Annual Allerton Conference
dc.descriptionNojima, R., Kadobayashi, Y., Cryptographically secure bloom-filters (2009) Trans. Data Privacy, 2 (2), pp. 131-139
dc.descriptionRothenberg, C.E., Data center networking with in-packet bloom filters (2010) SBRC 2010
dc.descriptionMacApuna, 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, USA
dc.descriptionSärelä, M., Forwarding anomalies in Bloom filter based multicast (2011) INFOCOM, , Shanghai, China accepted for publication
dc.descriptionSä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, USA
dc.descriptionZahemszky, A., Jokela, P., Sarela, M., Ruponen, S., Kempf, J., Nikander, P., MPSS: Multiprotocol Stateless Switching (2010) Global Internet Symposium 2010, pp. 1-6
dc.descriptionRothenberg, 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
dc.languageen
dc.publisher
dc.relationComputer Networks
dc.rightsfechado
dc.sourceScopus
dc.titleIn-packet Bloom Filters: Design And Networking Applications
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución