现代电子技术2024，Vol.47Issue(24)：47-54,8.DOI:10.16652/j.issn.1004-373x.2024.24.008
基于索引布隆过滤器的DDS自动发现算法
DDS automatic discovery algorithm based on index BF
摘要
Abstract
Data distribution server(DDS)is extensively utilized in the network construction of distributed systems,and the automatic discovery mechanism is a key part of DDS.The simple discovery protocol(SDP)is used in most of the existing DDS automatic discovery mechanisms,which can cause problems such as high network load and low matching efficiency in large-scale distributed system network environment.On this basis,a lightweight DDS automatic discovery algorithm based on index bloom filter(BF)is proposed.Based on the multi-dimensional vector structure and the bit operation between index values,an index BF is designed to compress the information transmitted between nodes in the distributed system network and provide a lower misjudgment rate than the standard BF.The combination of index BF and SDP can reduce the resource consumption in DDS automatic discovery process and improve the matching efficiency.The experimental results demonstrate that when the node matching rate is 10%,the proposed DDS automatic discovery algorithm significantly can reduce the number of data packets by 46.39%and shorten the matching time by 73.30%compared with the SDPBloom algorithm based on the standard BF.关键词
数据分发服务/自动发现算法/布隆过滤器/分布式系统/简单发现协议/多维向量/误判率Key words
data distribution services/automatic discovery algorithm/bloom filter/distributed system/simple discovery protocol/multidimensional vector/misjudgment rate分类
信息技术与安全科学引用本文复制引用
刘黄彪,杨凡,宋歌,王峰俊,张琦,张小贝..基于索引布隆过滤器的DDS自动发现算法[J].现代电子技术,2024,47(24):47-54,8.基金项目
上海飞机设计研究院课题项目(XZB2019025) （XZB2019025）
