Bloom Filter-based Routing for Dominating Set-based Service-Centric Networks
Ali Marandi, Vincent Hofer, Mikael Gasparyan, Torsten Ingo Braun, Nikolaos Thomos · 2020
A service-centric network requires a routing protocol to route service requests towards service providers. Routing operations can be divided into intra-domain and inter-domain routing. In the proposed approach, a so-called supernode is responsible for managing its own domain as well as for communicating with the supernodes of other domains to perform inter-domain routing. In order to appoint appropriate nodes as supernodes in the network topology, in this paper, we use Dominating Sets (DS) and Connected Dominating Sets (CDS). We propose fully distributed algorithms for constructing DS as well as CDS over the network topology. To prepare routing information, the nodes of each domain inform their supernodes about their available service names and resources (e.g., CPU, RAM). To this aim, the nodes use Bloom filters which reduce bandwidth and storage overhead. The performance evaluation shows that the required bandwidth overhead for DS and CDS construction algorithms increases with the topology size. The results also show that for large network topologies, CDS-based routing requires significantly less bandwidth overhead than both DS-based routing and Named Data Networking with multicast forwarding strategy. Finally, from the results we can observe that both DS-based and CDS-based routing have significantly lower service retrieval time than NDN multicast strategy.