Flooding (computer networking)
From Wikipedia, the free encyclopedia
 |
It has been suggested that this article or section be merged with Flooding_algorithm. (Discuss) |
 |
This article does not cite any references or sources. (March 2008) Please help improve this article by adding citations to reliable sources. Unverifiable material may be challenged and removed. |
 |
This article or section is in need of attention from an expert on the subject. WikiProject Computer science or the Computer science Portal may be able to help recruit one. |
Flooding is a simple routing algorithm in which every incoming packet is sent through every outgoing link.
[edit] Advantages
- If a packet can be delivered, it will (probably multiple times).
- Since flooding naturally utilizes every path through the network, it will also use the shortest path.
- This algorithm is very simple to implement.
[edit] Problems
- Flooding can be costly in terms of wasted bandwidth and, as in the case of a Ping flood or a Denial of service attack, it can be harmful to the reliability of a computer network.
- Duplicate packets may circulate forever, unless certain precautions are taken:
- Use a hop count or a time to live count and include it with each packet. This value should take into account the number of nodes that a packet may have to pass through on the way to its destination.
- Have each node keep track of every packet seen and only forward each packet once.
