Node discovery scheme of DDS using dynamic bloom filters

This paper proposes SDP-Dynamic Bloom, which is an extension of the node discovery scheme in data distribution service (DDS). A node discovery scheme is required to establish communication through discovery of matched endpoints. DDS uses simple discovery protocol (SDP) as its node discovery scheme. SDP works by sending each endpoint information to all endpoints that produce high network traffic in large-scale networks. A node discovery scheme based on dynamic Bloom filters (DBF) is proposed to improve DDS scalability by reducing the number of sent and stored messages in the network. Furthermore, the proposed scheme reduces unnecessary computing time spent restructuring Bloom filters, especially in unstable large-scale network environments. The simulation results show that the proposed scheme improves network latency.