Scalable DDS Discovery Protocols Based on Bloom Filters

Áreas de investigación:

• Methodology - Machine learning

Año:

2007

Tipo de publicación:

Artículo en conferencia

Autores:

• Sánchez-Monedero, Javier
• Lopez-Soler, J. M.
• Povedano-Molina, J.

Título del libro:

Real-time and Embedded Systems Workshop, Arlington VA, USA

BibTex:

@conference{Sanchez2007, author = "Javier S{\'a}nchez-Monedero and J.M. Lopez-Soler and J. Povedano-Molina", abstract = "The OMG Data Distribution Service (DDS) standard has been recently adopted for real-time data communications. In any DDS platform, to deal with heterogeneous environments and to provide transparent communications, an entity discovery protocol is required. Broadly speaking, an exhaustive discovery approach could result in quadratic complexity. Obviously, the scalability of DDS infrastructure is somehow limited by the adopted discovery protocol. In this work, inspired by peer-to-peer and agent based networking services, we propose a preliminary study on scalable discovery protocols for DDS. In particular, we propose and evaluate solutions to the discovery DDS scalability problem by using Bloom Filters (BF).", address = " ", booktitle = "Real-time and Embedded Systems Workshop, Arlington VA, USA", crossref = " ", editor = " ", month = " ", number = " ", organization = " ", pages = " ", publisher = " ", series = " ", title = "{S}calable {DDS} {D}iscovery {P}rotocols {B}ased on {B}loom {F}ilters", url = "http://www.omg.org/news/meetings/workshops/RT-2007/04-2_Sanchez-Moder_etal-revised.pdf", volume = " ", year = "2007", }

Abstract:

The OMG Data Distribution Service (DDS) standard has been recently adopted for real-time data communications. In any DDS platform, to deal with heterogeneous environments and to provide transparent communications, an entity discovery protocol is required. Broadly speaking, an exhaustive discovery approach could result in quadratic complexity. Obviously, the scalability of DDS infrastructure is somehow limited by the adopted discovery protocol. In this work, inspired by peer-to-peer and agent based networking services, we propose a preliminary study on scalable discovery protocols for DDS. In particular, we propose and evaluate solutions to the discovery DDS scalability problem by using Bloom Filters (BF).