MAD‐DDS: Memory‐efficient automatic discovery data distribution service for large‐scale distributed control network

Abstract

Abstract The rampant deployment of data distribution service (DDS) as middle‐ware service providers for industrial network platforms has been widely investigated. All DDS‐based node discovery protocols establish communication with its intended target systems by accessing matched endpoints/nodes information. These matched endpoints/nodes information is usually embedded with the system’s programmable control plane network which acts as the conveyor vehicle. The introduction of software defined networking (SDN) is to characterize the control plane from embedded data plane. The DDS implements the simple discovery protocol (SDP) as its inherent node discovery protocol. Deploying DDS for data packet exchange in server‐based collaborative distributed networked control (DNC) systems has gained traction. The current automatic discovery protocol (ADP) based on SDP is fraught with real‐time limitations such as high memory consumption and poor packet transmission. This work presents novel memory‐efficient automatic discovery data distribution service (MAD‐DDS) with enhanced threshold bloom filters (ETBF) where ETBF stores transmission packets at simulation end‐nodes. The packet is further adjusted using optimized binarization and decision thresholds inside ADP, hence guaranteeing memory reduction. The testbed computation recorded significantly improved quality of service (QoS) whereas numerical results depict significant decline in memory consumption with consistent packet transmission rates that produces increased computational capacity.

Keywords

• automatic repeat request
• broadcast communication
• data communication
• distributed networked control
• data distribution service