Analysis of Amnesiac Flooding
Volker Turau

TL;DR
This paper analyzes the termination time of amnesiac flooding in distributed systems, establishing NP-completeness of the (k,c)-flooding problem and providing bounds for different graph types.
Contribution
It introduces the (k,c)-flooding problem, proves its NP-completeness, and offers bounds for flooding termination times, highlighting differences between bipartite and non-bipartite graphs.
Findings
NP-completeness of the (k,c)-flooding problem
Sharp bounds for flooding termination time
Discrepancy between bipartite and non-bipartite graphs
Abstract
The broadcast operation in distributed systems is used to spread information located at some nodes to all other nodes. This operation is often realized by flooding, where the source nodes send a message containing the information to all neighbors. Each node receiving the message for the first time forwards it to all other neighbors. A stateless variant of flooding for synchronous systems is called amnesiac flooding. In this case, every time a node receives a message, it forwards it to those neighbors, from which it did not receive the message in the current round. The algorithm is oblivious and therefore scales very well. Stateless protocols are advantageous in high volume applications, increasing performance by removing the load caused by retention of session information and by providing crash tolerance. In this paper we analyze the termination time of amnesiac flooding. We define the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrenatal Substance Exposure Effects · Sleep and Wakefulness Research
