ABSTRACT
Flooding is a fundamental distributed algorithms technique. Consider the following flooding process, for simplicity, in a synchronous message passing network: A distinguished node begins the flooding process by sending the (same) message to all its neighbours in the first round. In subsequent rounds, every node receiving the message relays a copy of the message further to all those, and only those, nodes it did not receive the message from in the previous round. However, the nodes do not remember if they've taken part in the flooding before and therefore will repeat the process every time they get a message. In other words, they execute an amnesiac flooding process with memory only of the present round. The flooding process terminates in a particular round when no edge in the network carries the message in that, and, hence, subsequent, rounds. We call this process Amnesiac Flooding (AF).
In this work, the main question we address is whether AF will terminate on an arbitrary network (graph) and in what time? We show that, indeed, AF terminates on any arbitrary graph. Further, AF terminates in at most D rounds in bipartite graphs and at most 2D + 1 rounds in non-bipartite graphs - in this brief announcement, we show this for the bipartite case only.
We also show that in a natural asynchronous variant of AF, an adversary can always ensure non-termination.
- James Aspnes. 2019. Flooding. http://www.cs.yale.edu/homes/aspnes/pinewiki/Flooding.htmlGoogle Scholar
- Hagit Attiya and Jennifer Welch. 2004. Distributed Computing: Fundamentals, Simulations and Advanced Topics. John Wiley & Sons. Google ScholarDigital Library
- Benjamin Doerr, Mahmoud Fouz, and Tobias Friedrich. 2011. Social Networks Spread Rumors in Sublogarithmic Time. Electronic Notes in Discrete Mathematics, Vol. 38 (2011), 303 -- 308. The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011.Google ScholarCross Ref
- Robert Els"asser and Thomas Sauerwald. 2008. The Power of Memory in Randomized Broadcasting. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '08). SIAM, Philadelphia, PA, USA, 218--227. Google ScholarDigital Library
Index Terms
- On Termination of a Flooding Process
Recommendations
Flooding in wireless ad hoc networks
In an ad hoc network, each host assumes the role of a router and relays packets toward final destinations. This paper studies efficient routing mechanisms for packet flooding in ad hoc wireless networks. Because a packet is broadcast to all neighboring ...
Modeling the performance of flooding in wireless multi-hop Ad hoc networks
One feature common to most existing routing protocols for wireless mobile ad hoc networks, or MANETs, is the need to flood control messages network-wide during the route acquisition and maintenance process. Flooding of control messages may result in ...
Probabilistic and Neighbour Knowledge Based Flooding Mechanism for AODV
ACCT '14: Proceedings of the 2014 Fourth International Conference on Advanced Computing & Communication TechnologiesMobile Adhoc Network (MANET) is consist of group of mobile nodes communicating in a multi-hop way with no fixed infrastructure. To search such a multi-hop route to another nodes, each MANET node widely use HELLO packet. Flooding is important and most ...
Comments