Encyclopedia > Flooding algorithm

  Article Content

Flooding algorithm

A flooding algorithm is an algorithm for distributing material to every part of a connected network. 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 systems[?] and as part of some routing protocols, including OSPF, DVMRP[?], and those used in ad-hoc wireless networks[?].

There are several variants of flooding algorithm: most work roughly as follows.

  1. Each node acts as both a transmitter and a receiver.
  2. 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.

Real-world flooding algorithms have to be more complex than this, since precautions have to be taken to avoid wasted duplicate deliveries and infinite loops, and to allow messages to eventually expire from the system.

Flooding algorithms are also useful for solving many mathematical problems, including maze problems and many problems in graph theory.

See also:

All Wikipedia text is available under the terms of the GNU Free Documentation License

  Search Encyclopedia

Search over one million articles, find something about almost anything!
  Featured Article
Jamesport, New York

... older. The average household size is 2.41 and the average family size is 2.88. In the town the population is spread out with 20.6% under the age of 18, 5.0% from 18 to 24, ...

This page was created in 28.9 ms