Content deleted Content added
flood fill |
No edit summary |
||
Line 14:
Flooding algorithms are also useful for solving many mathematical problems, including [[maze]] problems and many problems in [[graph theory]].
== Disadvantages of Flooding ==
There are several disadvantages with this approach to routing. It is very wasteful in terms of the networks total bandwidth. While a message may only have one destination it has to be sent to every host. This reduces the maximum load that can be placed upon the network.
Messages can also become duplicated in the network this further increases the load on the networks bandwidth as well as requiring an increase in processing complexity to disregard duplicate messages.
== Advantages of Flooding ==
The main advantage of flooding is the increased reliability provided by this routing method. Since the message will be sent at least once to every host it is almost guaranteed to reach its destination.
==See also==
| |||