Proceedings of the 2014 IEEE Emerging Technology and Factory Automation (ETFA) 2014
DOI: 10.1109/etfa.2014.7005307
|View full text |Cite
|
Sign up to set email alerts
|

Node discovery scheme of DDS using dynamic bloom filters

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…Our work extends this by adding more reachability verification on fnmatch expression to ensure that no covert channels exist in candidate policies. Khaefi et al [11], [12] presented how using a bloom filter in DDS node discovery phase could significantly reduce the payload of handshake traffic at the expense of a tiny chance of collision. Encoding topic discovery data into a bloom filter indeed obscures the topic expressions while providing some probabilistic integrity of the topic permissions.…”
Section: Ddsmentioning
confidence: 99%
“…Our work extends this by adding more reachability verification on fnmatch expression to ensure that no covert channels exist in candidate policies. Khaefi et al [11], [12] presented how using a bloom filter in DDS node discovery phase could significantly reduce the payload of handshake traffic at the expense of a tiny chance of collision. Encoding topic discovery data into a bloom filter indeed obscures the topic expressions while providing some probabilistic integrity of the topic permissions.…”
Section: Ddsmentioning
confidence: 99%