Research On Lap Routing Algorithm Based On Traversal Tree

In the OSPF (Open Shortest Path First) protocol, using the traditional Flooding algorithm to convergence network topology will produce a large amount of redundant information and cause the waste of communication resources. LAP (Limitation Arrangement Principle) routing algorithm is introduced in this paper, which can be able to effectively solve the above problems. An LAP routing algorithm based on the traversal tree is proposed. The results show, when the number of links increases, the number of communications will reduce sharply during the network topology convergence completed by the BFS (Breadth First Search) traversal LAP routing algorithm. Compared with Flooding algorithm, LAP routing algorithm based on the BFS traversal tree has less number of communications when the number of links between the nodes exceeds a threshold value. LAP routing algorithm improves the overall efficiency of the network topology convergence.