Research On Node Potential Oriented Multi-NextHop Routing Protocol And Performance Evaluation

With the continuous development of information technology and the increasing influence for every aspect of human life, network infrastructure has been strategy resource related the benefit of nations and people and the importance of the network fast recovery becomes increasing remarkably. Recently, though, people invest a large number of manpower resources and material resources into managing and maintaining network, recovery techniques are still indispensable. Nowadays, enhancing the fast self-recovery capability still faces two challenges: under extreme environments such as military attacks, terrorism attacks and natural disasters how to improve network self-recovery and under normal environments how to deal with node failures.Network fast self-recovery technique is used in several layers, including network layer, network layer,data link layer and physical layer. Combined with the national 863 objective orientation project in information technology field–―self- recovery routing protocol and test system‖, the subject is concerned on the fast self-recovery in network layer under certain scenarios. This dissertation proposes a new routing protocol—Node Potential Oriented Multi-NextHop Routing Protocol by the prerequistite not to alter the current network routing framework, which can guarantee packets to forward during the convergence time when the network suffers from huge destruction or normal failures. Through analyzing and optimizing protocol mechanism, self-adaptive ability and scalability of protocol is enhanced and application environment is extended.This dissertation is organized as follows:A Multi-NextHop routing forwarding architecture is proposed, which do not alter the current IP hop-by-hop forwarding mechanism. The propagation direction of packets is constrained by routing metrics. The packets can be distributed into multiple next hops in parallel, making maximum use of all feasible next hops, so that the link utility ratio is globally even. Compared with the single shortest-path routing, this architecture can effectively avoid congestion and shorten protection switching delay. The path establishment and maintenance can be accomplished by routing information advertisement mechanism between peers. The control overhead of the protocol is smaller than that of multi-path routing protocol. This mechanism can provide more feasible next hops and high recovery probability, when the network incurs multiple concurrent failures.This paper presents an algorithm for estimating available bandwidth of network nodes, based on statistical information, and designs node potential in combination with lexicographic order including hop count and available bandwidth. According to node potential, the multi-nexthop loop-free routing table can be established through proving the isopiestic pressure of the node potential.A routing information propagation mechanism is designed, which decouples the network topology information from the reachability information. This technique can cut down the control overhead of the protocol trough analysis and estimation and reduce the frequency of routing updated, which has the important value for enhancing the network performance. It also can be widely applied for other network routing protocols.A neighbor synchronize distributed breadth first search algorithm named NS-DBFS has been designed to complete node potential information propagation for NP-MNRP protocol and distributed construct a potential energy diagram in the network. This article proposes a multi-nexthop routing protocol based on node potential divided by"zone"which is determined by the node forwarding delay. This method defines the reference of the forwarding delay of the single next hop and then divides the forwarding delay into several cyclic zones according to different levels of forwarding delay. Every cyclic zone is a routing subregion, in which nodes implement node potential oriented Multi-NextHop routing protocol. Routing between two cyclic zones is selected on the basis of the cyclic zone delay. Using this hierarchical structure, node potential oriented multi-nexthop routing protocol can be applied in heterogeneous networks and solve the problem of scalability in other routing protocols.In order to improve node potential oriented multi-nexthop routing protocol further, security mechanisms, network plans and other potential definitions are needed to study.