Achieving Reliability in Link State Protocol using Efficient Flooding and Traffic Splitting

Abstract

To find out the shortest path from source to destination, Link State Routing Protocol (LSRP) uses the Open shortest path first algorithm, in OSPF if there is change in network topology, the LSRP generates the Link State Advertisement (LSA) packets. This LSA packet is send to every neighbor node except from which it accept. This mechanism is called the Flooding mechanism , due to this flooding mechanism all the node’s will have the same database. If there are N nodes in the network then there is N (N-1) LSA packets are required for database synchronization. In this proposed System, it just not tied to reduce the number of LSA packets flooded into the network by constructing the minimal spanning tree but also it uses the traffic splitting mechanism to send the data. Also to achieve the stability in network it add the extra flooding link at the node, who have the degree of one. So this proposed method , minimize the LSA Overhead.