Bloom Filter-Based Content Discovery and Retrieval for Information-Centric Networks

Marandi, Sayed Ali (2020). Bloom Filter-Based Content Discovery and Retrieval for Information-Centric Networks. (Dissertation, Institute of Computer Science, Faculty of Science)

Thesis_Marandi.pdf - Published Version
Available under License Creative Commons: Attribution-Noncommercial-No Derivative Works (CC-BY-NC-ND).

Download (7MB) | Preview

Named Data Networking (NDN) requires routing protocols that use content object names for routing clients’ requests. In this thesis, we develop routing protocols for NDN based on content advertisements that we compress using Bloom filters (BF). We propose push-based Bloom Filter-based Routing (BFR) and pull-based BFR for NDN. Push-based BFR advertises all provided content object names, while pull-based BFR only advertises the requested content object names. Therefore, pull-based BFR outperforms push-based BFR in terms of the required communication and storage overhead for content advertisements. To reduce content retrieval delay, we propose to use Network Coding (NC)-based content retrieval. We use the BF-based information distributed for content discovery to select network codes. The proposed NC-based protocol uses a constraint on the equation system size and BF-based feedbacks to control codeblock size. We show that the proposed NC-based protocol achieves lower average content block retrieval delay than push-based and pull-based BFR. Service-Centric Networking [21] requires load balancing mechanisms to route service requests. To address this requirement, Layered-Service Centric Networking (L-SCN) [31] proposed to divide nodes into domains where each domain of nodes is managed by a supernode. However, L-SCN lacks algorithms to select supernodes in the network topology. We present supernode selection algorithms based on the construction of Dominating Sets (DS) and Connected Dominating Sets (CDS) over the network topology. Then, we propose intra-domain and inter-domain BF-based routing protocols for routing service requests. We show that our CDS-based routing protocols require much less bandwidth overhead for routing than both DS-based routing and NDN multicast strategy. Further, we show that both DS-based and CDS-based routing protocols achieve significantly less service retrieval delay than the NDN multicast strategy.

Item Type:

Thesis (Dissertation)


08 Faculty of Science > Institute of Computer Science (INF) > Communication and Distributed Systems (CDS)
08 Faculty of Science > Institute of Computer Science (INF)

UniBE Contributor:

Marandi, Sayed Ali


000 Computer science, knowledge & systems
500 Science
500 Science > 510 Mathematics




Dimitrios Xenakis

Date Deposited:

11 Dec 2020 09:18

Last Modified:

11 Dec 2020 09:18

Uncontrolled Keywords:

Named Data Networking, Routing, Bloom Filters, Network Coding, Service-Centric Networking, Dominating Sets




Actions (login required)

Edit item Edit item
Provide Feedback