Proceedings chapter

I(FIB)F: Iterated bloom filters for routing in named data networks

Presented at Gottingen (Germany), 13-16 March 2017
Publication date2017

Named Data Networks provide a clean-slate redesign of the Future Internet for efficient content distribution. Because Internet of Things are expected to compose a significant part of Future Internet, most content will be managed by constrained devices. Such devices are often equipped with limited CPU, memory, bandwidth, and energy supply. However, the current Named Data Networks design neglects the specific requirements of Internet of Things scenarios and many data structures need to be further optimized. The purpose of this research is to provide an efficient strategy to route in Named Data Networks by constructing a Forwarding Information Base using Iterated Bloom Filters defined as I(FIB)F. We propose the use of content names based on iterative hashes. This strategy leads to reduce the overhead of packets. Moreover, the memory and the complexity required in the forwarding strategy are lower than in current solutions. We compare our proposal with solutions based on hierarchical names and Standard Bloom Filters. We show how to further optimize I(FIB)F by exploiting the structure information contained in hierarchical content names. Finally, two strategies may be followed to reduce: (i) the overall memory for routing or (ii) the probability of false positives.

  • Iterated Bloom Filters
  • Named Data Networking
  • Information-Centric Networking
Citation (ISO format)
MUNOZ ILLESCAS, Cristina et al. I(FIB)F: Iterated bloom filters for routing in named data networks. In: International Conference on Networked Systems (NetSys 2017). Gottingen (Germany). [s.l.] : IEEE, 2017. p. 1–8. doi: 10.1109/NetSys.2017.7903945
Main files (1)
Proceedings chapter (Published version)

Technical informations

Creation05/06/2020 3:56:00 PM
First validation05/06/2020 3:56:00 PM
Update time03/15/2023 9:55:01 PM
Status update03/15/2023 9:55:01 PM
Last indexation01/17/2024 9:48:11 AM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack