A Comparative Analysis of Bloom Filter-based Routing Protocols for Information-Centric Networks

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 filterbased routing protocols, namely BFR and COBRA. BFR is a push-based routing protocol that works based on Bloom filterbased 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.

[1]  Hang Liu,et al.  A multi-level DHT routing framework with aggregation , 2012, ICN '12.

[2]  Alexander Afanasyev,et al.  ndnSIM 2 . 0 : A new version of the NDN simulator for NS-3 , 2015 .

[3]  Bengt Ahlgren,et al.  A survey of information-centric networking , 2012, IEEE Communications Magazine.

[4]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1996, SIGMETRICS '96.

[5]  Fan Deng,et al.  Approximately detecting duplicates for streaming data using stable bloom filters , 2006, SIGMOD Conference.

[6]  David E. Taylor,et al.  Longest prefix matching using bloom filters , 2006, TNET.

[7]  Syed Obaid Amin,et al.  NLSR: named-data link state routing protocol , 2013, ICN '13.

[8]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[9]  Ahmed Waliullah Kazi.  Prefetching Bloom filters to control flooding in content-centric networks , 2010, CoNEXT '10 Student Workshop.

[10]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[11]  Gennaro Boggia,et al.  COBRA: Lean intra-domain routing in NDN , 2014, 2014 IEEE 11th Consumer Communications and Networking Conference (CCNC).

[12]  Injong Rhee,et al.  Advertising cached contents in the control plane: Necessity and feasibility , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

[13]  Torsten Braun,et al.  BFR: A bloom filter-based routing approach for information-centric networks , 2017, 2017 IFIP Networking Conference (IFIP Networking) and Workshops.

[14]  Alexander Afanasyev,et al.  On the role of routing in named data networking , 2014, ICN '14.

[15]  Diego Perino,et al.  Caesar: A content router for high-speed forwarding on content names , 2012, 2014 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

[16]  Yanghee Choi,et al.  SCAN: Scalable Content Routing for Content-Aware Networking , 2011, 2011 IEEE International Conference on Communications (ICC).