Content deleted Content added
This results in every message eventually being delivered to all reachable parts of the network |
including OSPF, DVMRP, and those used in ad-hoc wireless networks. |
||
Line 1:
A '''flooding algorithm''' is a method for distributing material to every part of a connected system. The name derives from the concept of inundation by a [[flood]].
Flooding algorithms are used in systems such as [[Usenet]] and [[peer-to-peer]] [[file sharing system]]s and as part of some [[routing algorithm]]s, including [[OSPF]], [[DVMRP]], and those used in [[ad-hoc wireless network]]s.
There are several variants of flooding algorithms: most works as follows. Each node acts as both a transmitter and a receiver. Each node tries to forward every message to every one of its neighbors. This results in every message eventually being delivered to all reachable parts of the network.
| |||