Research And Application On Routing Algorithm Based On Limit Arrangement Principle

With the rapid development of computer network, the network traffic also increase rapidly, and then many problems arise, for example, the computer network loads onerous, the switch speed of information slows down and the communication quality becomes poor. So, it should not be ignored to design an efficient, stable and flexible routing algorithm. In fact, the routing algorithm is not isolated, only it is applied to a specific routing protocol, it has the realistic significance and value.OSPF (Open Shortest Path First) is one of the more common internal gateway protocols, and its ultimate goal is to realize the information consistency of the whole network. Since the research on information consistency of the whole network is insufficient, a new algorithm based on limit arrangement principle for routing decision is proposed. It’s the most fundamental function for this algorithm is to accomplish the information consistency of the whole network as soon as possible. In this paper, the routing algorithm based on limit arrangement principle is illustrated in detail include the algorithm proposed, theoretical support for the algorithm, the design, simulation and prospect.Firstly, the problem of information consistency under OSPF protocol was proposed, and then the LAP algorithm was structured after research on ALAP (Another Limit Arrangement Principle). Secondly, LAP algorithm was applied to computer network, a LAP routing algorithm in single link network and two LAP routing algorithms in complex networks were designed, the two LAP algorithms included LAP routing algorithm in single network with multi-ring and LAP routing algorithm in complex networks based on regional binding. Meanwhile, the static simulation experiments were given for the three routing algorithms, the results of experiment show that they could accomplish the information consistency of the whole network. Finally, the dynamic simulation experiments were worked for the three routing algorithms under NS2 (Network Simulator Version 2), which further prove that the LAP routing algorithms can solve the problem of information consistency of the whole network, and the LAP routing algorithms are superior to Dijkstra algorithm.