Options
A O(log n) distributed algorithm to construct routing structures for pub/sub systems: Regular submission
Publikationstyp
Conference Paper
Date Issued
2018
Sprache
English
Author(s)
Institut
TORE-URI
First published in
Number in series
11201 LNCS
Start Page
65
End Page
79
Citation
International Symposium on Stabilizing, Safety, and Security of Distributed Systems (SSS 2018)
Contribution to Conference
Publisher DOI
Scopus ID
Publisher
Springer
The Industrial Internet of Things relies on event-driven services that run on wireless networks using low power protocols. The loose coupling and the inherent scalability make publish/subscribe systems an ideal candidate for such systems. This work introduces a new routing structure for such systems and an efficient distributed algorithm to build this structure. This routing structure supports all features of PSVR, a recently introduced publish/subscribe Middleware for IIoT applications. Provided the density of the underlying communication graph is sufficiently high, each node can be reached using at most O(log n) hops. The algorithm is analyzed for random graphs and we prove that w.h.p. the data structure can be built in O(log n) synchronous rounds.
DDC Class
004: Informatik