Publisher DOI: 10.1007/978-3-030-03232-6_5
Title: A O(log n) distributed algorithm to construct routing structures for pub/sub systems: Regular submission
Language: English
Authors: Turau, Volker 
Issue Date: 2018
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (11201 LNCS): 65-79 (2018)
Part of Series: Lecture notes in computer science 
Volume number: 11201
Abstract (english): 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.
ISBN: 978-303003231-9
ISSN: 0302-9743
Institute: Telematik E-17 
Type: InProceedings (Aufsatz / Paper einer Konferenz etc.)
Project: Fehlertolerante verteilte Algorithmen 
Appears in Collections:Publications without fulltext

Show full item record

Page view(s)

Last Week
Last month
checked on Oct 1, 2020

Google ScholarTM


Add Files to Item

Note about this record


Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.