BFR: a Bloom filter-based routing approach for information-centric networks

Marandi, Sayed Ali; Braun, Torsten; Salamatian, Kave; Thomos, Nikolaos (June 2017). BFR: a Bloom filter-based routing approach for information-centric networks. In: IFIP Networking 2017. IFIP 10.23919/IFIPNetworking.2017.8264842

Text camera ready.pdf - Accepted Version Restricted to registered users only Available under License Publisher holds Copyright. Download (944kB)

Locating the demanded content is one of the major challenges in Information-Centric Networking (ICN). This process is known as content discovery. To facilitate content discovery, in this paper we focus on Named Data Networking (NDN) and propose a novel routing scheme for content discovery, called Bloom Filter-based Routing (BFR), which is fully distributed, content oriented, and topology agnostic at the intra-domain level. In BFR, origin servers advertise their content objects using Bloom filters. We compare the performance of BFR with flooding and shortest path content discovery approaches. BFR outperforms its counterparts in terms of the average round-trip delay, while it is shown to be very robust to false positive reports from Bloom filters. Also, BFR is much more robust than shortest path routing to topology changes. BFR strongly outperforms flooding and performs almost equal with shortest path routing with respect to the normalized communication costs for data retrieval and total communication overhead for forwarding Interests. All the three approaches achieve similar mean hit distance. The signalling overhead for content advertisement in BFR is much lower than the signalling overhead for calculating shortest paths in the shortest path approach. Finally, BFR requires small storage overhead for maintaining content advertisements.

Interest & Impact

Downloads

16 since deposited on 30 May 2017
0 in the past 12 months

Citations

5 Citations in Web of Science ®
6 Citations in Scopus

Search

in Google Scholar™

Services

Actions (login required)

Edit item

Actions (login required)

Edit item