扩展计数布隆滤波器用于军舰数据分发服务的发现协议

H. A. Putra, Dwi Agung Nugroho, Dong-Seong Kim, Yoon-Suk Choi
{"title":"扩展计数布隆滤波器用于军舰数据分发服务的发现协议","authors":"H. A. Putra, Dwi Agung Nugroho, Dong-Seong Kim, Yoon-Suk Choi","doi":"10.1109/ETFA.2013.6648047","DOIUrl":null,"url":null,"abstract":"In this paper, a novel discovery protocol using modified counting Bloom filters for data distribution service (DDS) is proposed. In current discovery protocols for DDS, each participant sends its endpoint data to every participant, and receives endpoint data from all other participants. In a large network such as naval warships, a lot of memory is required to store all the data. In many cases, most of the data stored is not needed by the endpoints but occupy memory storage. To reduce the size of data sent and stored, a discovery process combined with counting bloom filter is proposed. This paper presents the delay time for filters construction and the total discovery time needed in a naval warship network topology. The simulation results shows that the proposed method gives low delay time and no false positive probability.","PeriodicalId":106678,"journal":{"name":"2013 IEEE 18th Conference on Emerging Technologies & Factory Automation (ETFA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Discovery protocol for data distribution service in naval warships using extended counting bloom filters\",\"authors\":\"H. A. Putra, Dwi Agung Nugroho, Dong-Seong Kim, Yoon-Suk Choi\",\"doi\":\"10.1109/ETFA.2013.6648047\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a novel discovery protocol using modified counting Bloom filters for data distribution service (DDS) is proposed. In current discovery protocols for DDS, each participant sends its endpoint data to every participant, and receives endpoint data from all other participants. In a large network such as naval warships, a lot of memory is required to store all the data. In many cases, most of the data stored is not needed by the endpoints but occupy memory storage. To reduce the size of data sent and stored, a discovery process combined with counting bloom filter is proposed. This paper presents the delay time for filters construction and the total discovery time needed in a naval warship network topology. The simulation results shows that the proposed method gives low delay time and no false positive probability.\",\"PeriodicalId\":106678,\"journal\":{\"name\":\"2013 IEEE 18th Conference on Emerging Technologies & Factory Automation (ETFA)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE 18th Conference on Emerging Technologies & Factory Automation (ETFA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ETFA.2013.6648047\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 18th Conference on Emerging Technologies & Factory Automation (ETFA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ETFA.2013.6648047","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种基于改进计数布隆过滤器的数据分布服务发现协议。在当前的DDS发现协议中,每个参与者将其端点数据发送给其他参与者,并从所有其他参与者接收端点数据。在海军军舰这样的大型网络中,需要大量的内存来存储所有的数据。在许多情况下,端点不需要存储的大部分数据,而是占用内存存储。为了减少发送和存储的数据量,提出了一种结合计数布隆滤波器的发现过程。本文给出了舰船网络拓扑结构中滤波器构造的延迟时间和总发现时间。仿真结果表明,该方法具有较低的延迟时间和无误报概率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Discovery protocol for data distribution service in naval warships using extended counting bloom filters
In this paper, a novel discovery protocol using modified counting Bloom filters for data distribution service (DDS) is proposed. In current discovery protocols for DDS, each participant sends its endpoint data to every participant, and receives endpoint data from all other participants. In a large network such as naval warships, a lot of memory is required to store all the data. In many cases, most of the data stored is not needed by the endpoints but occupy memory storage. To reduce the size of data sent and stored, a discovery process combined with counting bloom filter is proposed. This paper presents the delay time for filters construction and the total discovery time needed in a naval warship network topology. The simulation results shows that the proposed method gives low delay time and no false positive probability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信