A $$O(\log n)$$ Distributed Algorithm to Construct Routing Structures for Pub/Sub Systems Regular Submission

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...

Full description

Saved in:
Bibliographic Details
Published inStabilization, Safety, and Security of Distributed Systems pp. 65 - 79
Main Author Turau, Volker
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing 20.10.2018
SeriesLecture Notes in Computer Science
Subjects
Distributed algorithm
Publish/Subscribe
Random graph
Routing structure
Online AccessGet full text
ISBN3030032310
9783030032319
ISSN0302-9743
1611-3349
DOI10.1007/978-3-030-03232-6_5

Cover

More Information
Summary: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.
Bibliography:Original Title: A \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(\log n)$$\end{document} Distributed Algorithm to Construct Routing Structures for Pub/Sub Systems
Original Abstract: 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 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(\log n)$$\end{document} hops. The algorithm is analyzed for random graphs and we prove that w.h.p.  the data structure can be built in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(\log n)$$\end{document} synchronous rounds.
This work is supported by the Deutsche Forschungsgemeinschaft (DFG) under grant DFG TU 221/6-3.
ISBN:3030032310
9783030032319
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-030-03232-6_5