MAD‐DDS: Memory‐efficient automatic discovery data distribution service for large‐scale distributed control network
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
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.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.006 | 0.003 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it