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 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.

Minimizing Traffic Blocking and Inter-Crosstalk in Spatial Division Multiplexing over Elastic Optical Networking

As a promising solution, virtualization is vigorously developed to eliminate the ossification of traditional Internet infrastructure and enhance the flexibility in sharing the substrate network (SN) resources including computing, storage, bandwidth, etc. With network virtualization, cloud service providers can utilize the shared substrate resources to provision virtual networks (VNs) and facilitate a wide and diverse range of applications. As more and more internet applications migrate to the cloud, the resource efficiency and the survivability of VNs, such as single link failure or large-scale disaster survivability, have become crucial issues. Elastic optical networks have emerged in recent years as a strategy for dealing with the divergence of network application bandwidth needs. The network capacity has been constrained due to the usage of only two multiplexing dimensions. As transmission rates rise, so does the demand for network failure protection. Due to their end-to-end solutions, those safe-guarding paths are of particular importance among the protection methods. Due to their end-to-end solutions, those safeguarding paths are of particular importance among the protection methods. This paper presents approaches that provide a failure-independent route-protecting p-cycle for path protection in space-division multiplexed elastic optical networks. This letter looks at two SDM network challenges and presents a heuristic technique (k-shortest path) for each. In the first approach, we study a virtual network embedding (SVNE) problem and propose an algorithm for EONs, which can combat against single-link failures. We evaluate the proposed POPETA algorithm and compare its performance with some counterpart algorithms. Simulation results demonstrate that the proposed algorithm can achieve satisfactory performance in terms of spectrum utilization and blocking ratio, even if with a higher backup redundancy ratio.