Solving information consistency routing under OSPF by using limitation arrangement principle
Lingling Zhang, Hong Zhang · 2016
We extend in this paper the limitation arrangement principle (LAP) algorithm, which was previously proposed and analyzed for addressing information consistency of the whole network under OSPF protocol. The LAP algorithm is inspired by the permutation and combination problem, and it has been proved to be able to apply to computer network. We design the LAP routing algorithm in complex networks based on region binding of three nodes to realize information consistency, after decomposing, re-composting and searching. In comparison with the well-known Dijkstra algorithm in CERNET, NSFNET, and CERNET2, we observe that the proposed algorithm is more efficient and robust.