Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 539793, 11 pages
http://dx.doi.org/10.1155/2014/539793
Research Article

Research on Routing Algorithm Based on Limitation Arrangement Principle in Mathematics

1College of Information Science and Engineering, Northeastern University, Shenyang, Liaoning 110819, China
2Key Laboratory of Networked Control System, The Chinese Academy of Sciences, Shenyang, Liaoning 110016, China

Received 13 July 2014; Revised 15 September 2014; Accepted 15 September 2014; Published 30 October 2014

Academic Editor: Dan Simon

Copyright © 2014 Jianhui Lv et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

Since the research on information consistency of the whole network under OSPF protocol has been insufficient in recent years, an algorithm based on limitation arrangement principle for routing decision is proposed and it is a permutation and combination problem in mathematical area. The most fundamental function of this algorithm is to accomplish the information consistency of the whole network at a relatively fast speed. Firstly, limitation arrangement principle algorithm is proposed and proved. Secondly, LAP routing algorithm in single link network and LAP routing algorithm in single link network with multiloops are designed. Finally, simulation experiments are worked by VC6.0 and NS2, which proves that LAPSN algorithm and LAPSNM algorithm can solve the problem of information consistency of the whole network under OSPF protocol and LAPSNM algorithm is superior to Dijkstra algorithm.