Single Failure Routing Protection Algorithm in the Hybrid SDN Network

Loop free alternate(LFA)is a routing protection scheme that is currently deployed in commercial routers.However,LFA cannot handle all single network component failure scenarios in traditional networks.As Internet service providers have begun to deploy software defined network(SDN)technology,the Internet will be in a hybrid SDN network where traditional and SDN devices coexist for a long time.Therefore,this study aims to deploy the LFA scheme in hybrid SDN network architecture to handle all possible single network component failure scenarios.First,the deployment of LFA scheme in a hybrid SDN network is described as a 0-1 integer linear programming(ILP)problem.Then,two greedy algorithms,namely,greedy algorithm for LFA based on hybrid SDN(GALFAHSDN)and improved greedy algorithm for LFA based on hybrid SDN(IGALFAHSDN),are proposed to solve the proposed problem.Finally,both algorithms are tested in the simulation environment and the real platform.Experiment results show that GALFAHSDN and IGALFAHSDN can cope with all single network component failure scenarios when only a small number of nodes are upgraded to SDN nodes.The path stretch of the two algorithms is less than 1.36.

Efficient Routing Protection Algorithm in Large-Scale Networks

With an increasing urgent demand for fast recovery routing mechanisms in large-scale networks,minimizing network disruption caused by network failure has become critical.However,a large number of relevant studies have shown that network failures occur on the Internet inevitably and frequently.The current routing protocols deployed on the Internet adopt the reconvergence mechanism to cope with network failures.During the reconvergence process,the packets may be lost because of inconsistent routing information,which reduces the network’s availability greatly and affects the Internet service provider’s(ISP’s)service quality and reputation seriously.Therefore,improving network availability has become an urgent problem.As such,the Internet Engineering Task Force suggests the use of downstream path criterion(DC)to address all single-link failure scenarios.However,existing methods for implementing DC schemes are time consuming,require a large amount of router CPU resources,and may deteriorate router capability.Thus,the computation overhead introduced by existing DC schemes is significant,especially in large-scale networks.Therefore,this study proposes an efficient intra-domain routing protection algorithm(ERPA)in large-scale networks.Theoretical analysis indicates that the time complexity of ERPA is less than that of constructing a shortest path tree.Experimental results show that ERPA can reduce the computation overhead significantly compared with the existing algorithms while offering the same network availability as DC.

Efficient Routing Protection Algorithm Based on Optimized Network Topology

Network failures are unavoidable and occur frequently.When the network fails,intra-domain routing protocols deploying on the Internet need to undergo a long convergence process.During this period,a large number of messages are discarded,which results in a decline in the user experience and severely affects the quality of service of Internet Service Providers(ISP).Therefore,improving the availability of intra-domain routing is a trending research question to be solved.Industry usually employs routing protection algorithms to improve intra-domain routing availability.However,existing routing protection schemes compute as many backup paths as possible to reduce message loss due to network failures,which increases the cost of the network and impedes the methods deployed in practice.To address the issues,this study proposes an efficient routing protection algorithm based on optimized network topology(ERPBONT).ERPBONT adopts the optimized network topology to calculate a backup path with the minimum path coincidence degree with the shortest path for all source purposes.Firstly,the backup path with the minimum path coincidence with the shortest path is described as an integer programming problem.Then the simulated annealing algorithm ERPBONT is used to find the optimal solution.Finally,the algorithm is tested on the simulated topology and the real topology.The experimental results show that ERPBONT effectively reduces the path coincidence between the shortest path and the backup path,and significantly improves the routing availability.

New artificial neural networks for true triaxial stress state analysis and demonstration of intermediate principal stress effects on intact rock strength

Simulations are conducted using five new artificial neural networks developed herein to demonstrate and investigate the behavior of rock material under polyaxial loading. The effects of the intermediate principal stress on the intact rock strength are investigated and compared with laboratory results from the literature. To normalize differences in laboratory testing conditions, the stress state is used as the objective parameter in the artificial neural network model predictions. The variations of major principal stress of rock material with intermediate principal stress, minor principal stress and stress state are investigated. The artificial neural network simulations show that for the rock types examined, none were independent of intermediate principal stress effects. In addition, the results of the artificial neural network models, in general agreement with observations made by others, show （a） a general trend of strength increasing and reaching a peak at some intermediate stress state factor, followed by a decline in strength for most rock types; （b） a post-peak strength behavior dependent on the minor principal stress, with respect to rock type; （c） sensitivity to the stress state, and to the interaction between the stress state and uniaxial compressive strength of the test data by the artificial neural networks models （two-way analysis of variance; 95% confidence interval）. Artificial neural network modeling, a self-learning approach to polyaxial stress simulation, can thus complement the commonly observed difficult task of conducting true triaxial laboratory tests, and/or other methods that attempt to improve two-dimensional （2D） failure criteria by incorporating intermediate principal stress effects.

Detecting and Locating Failures in Communication Networks

The connectivity of a strongly connected network may be destroyed after link damage.Since many net- works are connected by directed links,the reachability may be restored by altering the direction of one or more of the links and thus reconfigoring the network.The location of the failed link must first be determined.In this paper,we examine new methods to determine the location of failed links and nodes in networks.A routing test approach is proposed and the conditions under which communication networks may be tested are discussed. Finally,an adaptive algorithm and a heuristic algorithm that can locate a single failed llnk or a single failed node are presented.