Synchronous concurrent broadcasts for intermittent channels with bounded capacities

Publikationstyp
Conference Paper
Date Issued
2021-06-20
Sprache
English
Author(s)
Turau, Volker  
Institut
Telematik E-17  
TORE-URI
http://hdl.handle.net/11420/10166
First published in
Lecture notes in computer science  
Number in series
12810 LNCS
Start Page
296
End Page
312
Citation
International Colloquium on Structural Information and Communication Complexity (SIROCCO 2021)
Contribution to Conference
28th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2021  
Publisher DOI
10.1007/978-3-030-79527-6_17
Scopus ID
2-s2.0-85111446719
Publisher
Springer International Publishing
In this work we extend the recently proposed synchronous broadcast algorithm amnesiac flooding to the case of intermittent communication channels. In amnesiac flooding a node forwards a received message in the subsequent round. There are several reasons that render an immediate forward of a message impossible: Higher priority traffic, overloaded channels, etc. We show that postponing the forwarding for one or more rounds prevents termination. Our extension overcomes this shortcoming while retaining the advantages of the algorithm: Nodes don’t need to memorize the reception of a message to guarantee termination and messages are sent at most twice per edge. This extension allows to solve more general broadcast tasks such as multi-source broadcasts and concurrent broadcasts for systems with bounded channel capacities.
DDC Class
004: Informatik