Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2019-01-03 Cooperative journals: 《计算机应用研究》
Abstract： An efficient LFA implementation method which is based on Incremental Shortest Path First Algorithm (ERPISPF) was proposed to reduce the computational overhead and deployment difficulty of the existing LFA algorithm. The paper first turns the problem of quick implementation of LFA into how to efficiently calculate the minimum cost of all its neighbors to all other nodes of the network on the shortest path tree rooted at the compute node. Then a theorem for calculating the cost is presented and its correctness is proved. Finally, the time complexity of the algorithm was theoretically analyzed. Experiments show that compared with LFA algorithm, ERPISPF not only has less computation overhead, but also provides the same failure protection rate as LFA.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： Reducing the energy consumption of the Internet has become an urgent problem. However, the existing energy efficient routing algorithms are facing the following two problems: a) all of them will degrade the network performance in varying forms, such as network congestion, routing flap, routing availability and uneven traffic distribution; b) all of them require real-time traffic information, which lead to high complexity of the algorithm. Therefore, this paper designs a green energy efficient scheme EEIPFRR which is based on IP fast reroute, taking into account the energy saving, network performance and algorithm complexity. The experimental results show that compared with DLF algorithm, it can not only reduce network energy consumption, but also have less path stretch, lower algorithm complexity and maximum link utilization.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-11-29 Cooperative journals: 《计算机应用研究》
Abstract： The existing routing protection schemes do not consider the importance of nodes in the network; however, the importance of different nodes in the network is not the same in real networks. To solve this problem, this paper proposed an intra-domain routing protection algorithm based on node diversity (RPBND) . Firstly, the computing node constructed a shortest path tree rooted at the destination node, which ensured the compatibility between the RPBND and the current deployment intra-domain routing algorithm. Then, it builded a directed acyclic graph on the basis of the shortest path tree, which maximized the Internet routing availability. The experiment results show that RPBND greatly improves the Internet routing availability and reduces the network disruption time caused by the faults, which provides the sufficient basis for ISPs to deploy the intra-domain routing protection scheme.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-05-18 Cooperative journals: 《计算机应用研究》
Abstract： Software defined network (SDN) is a novel network architecture separating control plane and forwarding plane. SDN has been favored by the industry because of its flexibility and controllability. However, SDN usually employs the best paths to forward packets, which is difficult to deal with the node or link failures in the network. In order to improve the availability of SDN network, this paper proposed an intra-domain routing protection scheme based on SDN (RPBSDN) . The scheme could calculate multiple backup next hops for each source-destination, and guaranteed loop-freeness of the induced forwarding path by the underlying partial order of the nodes. The experimental results show that the scheme not only has small computational complexity, but also greatly improve the availability of the network.
Hits
Hits
Downloads
Comment