Principle of Flood Routing Protocol

The flood (mflood) routing algorithm is a simple and effective routing algorithm. The basic idea is that each node is a data group received by broadcast forwarding. if it receives a duplicate group, it is discarded. The flood protocol will cause the Data Group to spread with the source node as the center. In order not to cause the spread of a large area to occupy too much network resources and make the diffusion converge, you need to set the appropriate TTL value, ensure that the data group only goes through a limited hop route. In addition, each node needs to maintain a data group sequence number seq and a route table for repeated group detection, each time the source node sends a Data Group, it increases seq by 1 and adds the seq to the IP header of the Data Group, after receiving the data group, other nodes record the seq to the route table and perform repeated grouping Detection Based on the seq.

The biggest problem with the flood algorithm is that it will generate a large number of repeated groups and occupy network resources, resulting in excessive waste of resources on routers and links, resulting in low efficiency. However, the flood routing algorithm is the simplest and most reliable routing algorithm. In scenarios with sharp node movements and frequent inbound and outbound network changes, flood routing across the network is an effective method, it is extremely robust and can be used in military applications. It can also be used as a metric to evaluate other routing algorithms.