Bloom filter-based discovery protocol for DDS middleware

Javier Sánchez‐Monedero

doi:10.1016/j.jpdc.2011.05.001

Return

Bloom filter-based discovery protocol for DDS middleware

2011-10-01

Javier Sánchez‐Monedero *

Javier Povedano-Molina

Jose M. Lopez-Vega

Juan M. López-Soler

DOI：10.1016/j.jpdc.2011.05.001

Original

Save

View PDF

Abstract

En 中文

The Data Distribution Service (DDS) middleware has recently been standardized by the OMG. Prior to data communication, a discovery protocol had to locate and obtain remote DDS entities and their attributes. Specifically, DDS discovery matches the Data Writers (DWs) and DataReaders (DRs) entities (Endpoints) situated in different network nodes. DDS specification does not specify how this discovery is translated into the wire. To provide interoperability and transparency between different DDS implementations, the OMG has standardized the DDS Interoperability Wire Protocol (DDS-RTPS). Any compliant DDS-RTPS implementation must support at least the SDP (Simple Discovery Protocol). The SDP works in relatively small or medium networks but it may not scale as the number of DDS Endpoints increases. This paper addresses the design and evaluation of an SDP alternative - which uses Bloom Filters (BF) - that increases DOS scalability. BFs use Hash functions for space-efficient probabilistic data set representation. We provide both analytical and experimental studies. Results show that our approach can improve the discovery process (in terms of network load and node resource consumption), especially in those scenarios with large Endpoint per Participant ratios. (C) 2011 Elsevier Inc. All rights reserved.

Keywords:

DDS

Data Distribution Service

Discovery

Middleware

Bloom filter

Peer-to-peer

RTPS

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.