Efficient flooding for reliability in link-state routing protocols

In this paper we propose an efficient flooding process. Link state routing protocol has been widely employed in wired network applications. When network topology change occurs, a Link State Advertisement (LSA) is generated and flooded into the rest of the devices of the network. In our approach, we propose an efficient flooding method to reduce LSA overhead in link state routing protocols such as Open Shortest Path First (OSPF) and Intermediate system routing protocol (IS-IS). The proposed algorithm is an efficient method for large scale networks and wireless environments in that the problem of the LSA overhead and router CPU utilization. The proposed method has been validated through both performance analysis and computer simulation. The simulation results are quantitatively reported in the paper.