A Comparative Analysis of Bloom Filter-based Routing Protocols for Information-Centric Networks
Ali Marandi, Torsten Ingo Braun, Kavé Salamatian, Nikolaos Thomos · 2018
Bloom filter-based routing protocols for Named Data Networking (NDN) aim at facilitating content discovery in NDN. In this paper, we compare the performance of two Bloom filter-based routing protocols, namely BFR and COBRA. BFR is a push-based routing protocol that works based on Bloom filter-based content advertisements, while COBRA is a pull-based routing protocol that operates based on route traces left from previously retrieved content objects, which are stored in Stable Bloom Filters. In this paper, we show that BFR outperforms COBRA in terms of average memory needed for storing routing updates, average round-trip delay, normalized communication overhead, total Interest communication overhead, and mean hit distance.