Survivable Virtual Network Mapping Research Articles

Survivability Mapping Strategy for Virtual Wireless Sensor Networks for Link Failures in the Internet of Things

In the case of virtual wireless sensor networks, a link-failure-oriented survivable virtual sensor network mapping algorithm (F-SVNE) is proposed to address the issue of link failure in the underlying wireless sensor network. First, the algorithm utilizes the fast routing strategy and creates a backup route set based on a multi-path selection algorithm to reduce the delay in fault recovery caused by path selection. Second, the survivable virtual sensor network mapping algorithm is adopted based on the routing set. Finally, in the mapping stage, the efficiency and reliability of the algorithm are comprehensively considered, and the path with the largest survival probability is selected from the backup route set of the faulty link to remap the virtual link affected by the link failure. Empirical results demonstrate that the F-SVNE algorithm can efficaciously lessen the failure recovery delay, and improve the long-term average revenue–cost ratio and average failure recovery rate.

Survivable Virtual Network Mapping With Fiber Tree Establishment in Filterless Optical Networks

Filterless Optical Networks (FONs) (i.e., optical networks where switching nodes are solely based on passive splitters and combiners) enjoy features that are highly appreciated by network operators, such as their low cost and their energy efficiency, posing them as an alternative solution to filtered Wavelength-Switched Optical Networks (WSON) based on active switching nodes. Due to FONs’ specific design criteria (the network topology must be divided into link-disjoint filterless fiber trees to avoid laser loops), traditional network problems, such as survivable virtual network mapping, shall be revisited and tackled adopting novel solutions with respect to state-of-the-art filtered WSONs. In this paper, we investigate the problem of survivable virtual network mapping (SVNM) in FONs with the aim of evaluating the cost of survivability when adopting FON technology. We first model the problem as an Integer Linear Program to establish fiber trees and provide survivable mapping of virtual networks, while minimizing cost of additional network equipment and spectrum with respect to WSON. We then propose multiple heuristic and meta-heuristic approaches to tackle large problem instances. In our numerical evaluations, we consider three scenarios: FON, WSON, and FON with pre-established fiber trees. Results show that in FON, where SVNM is jointly optimized with fiber tree establishment, the investment in additional network equipment can be largely minimized, and even avoided in some cases. In contrast, in FON with pre-established trees, amount of additional network equipment needed to guarantee survivability is significant (up to 60% with respect to WSON).

Survivable virtual network mapping with content connectivity against multiple link failures in optical metro networks

Network connectivity, i.e., the reachability of any network node from all other nodes, is often considered as the default network survivability metric against failures. However, in the case of a large-scale disaster disconnecting multiple network components, network connectivity may not be achievable. On the other hand, with the shifting service paradigm towards the cloud in today’s networks, most services can still be provided as long as at least a content replica is available in all disconnected network partitions. As a result, the concept of content connectivity has been introduced as a new network survivability metric under a large-scale disaster. Content connectivity is defined as the reachability of content from every node in a network under a specific failure scenario. In this work, we investigate how to ensure content connectivity in optical metro networks. We derive necessary and sufficient conditions and develop what we believe to be a novel mathematical formulation to map a virtual network over a physical network such that content connectivity for the virtual network is ensured against multiple link failures in the physical network. In our numerical results, obtained under various network settings, we compare the performance of mapping with content connectivity and network connectivity and show that mapping with content connectivity can guarantee higher survivability, lower network bandwidth utilization, and significant improvement of service availability.

A Multidomain Survivable Virtual Network Mapping Algorithm

Although the existing networks are more often deployed in the multidomain environment, most of existing researches focus on single-domain networks and there are no appropriate solutions for the multidomain virtual network mapping problem. In fact, most studies assume that the underlying network can operate without any interruption. However, physical networks cannot ensure the normal provision of network services for external reasons and traditional single-domain networks have difficulties to meet user needs, especially for the high security requirements of the network transmission. In order to solve the above problems, this paper proposes a survivable virtual network mapping algorithm (IntD-GRC-SVNE) that implements multidomain mapping in network virtualization. IntD-GRC-SVNE maps the virtual communication networks onto different domain networks and provides backup resources for virtual links which improve the survivability of the special networks. Simulation results show that IntD-GRC-SVNE can not only improve the survivability of multidomain communications network but also render the network load more balanced and greatly improve the network acceptance rate due to employment of GRC (global resource capacity).

Prediction‐based survivable virtual network mapping against disaster failures

SummarySurvivable virtual network mapping (SVNM) guarantees that the mapped virtual network works normally against substrate failures. Most of the existing solutions are mainly focusing on single node or single link failure. A long‐standing challenge in SVNM is to reduce the capacity loss of network when substrate failures happen. Because some regions are frequently attacked by disasters, the disaster failures should be paid attention to. In this paper, we re‐consider the existing work on the SVNM and explore the feasible solution of SVNM against disaster failures. We first design the disaster failure model with the knowledge of risk assessment. Then we formulate the problem with the mixed integer programming. Two heuristic algorithms based on the prediction mechanism are proposed. Simulations show that our algorithms increase the average acceptance ratio and reduce the risk of capacity loss in the initial mapping phase compared with previous algorithms. Copyright © 2016 John Wiley & Sons, Ltd.

Survivable Virtual Topology Design in Multi-domain Optical Networks

We consider the problem of survivable virtual network mapping in a multi-domain optical network with the objective of minimizing total network link cost for a given virtual traffic demand. The survivability constraint guarantees the connectivity of virtual nodes after any single optical link failure. We propose a hierarchical software-defined networking-based control plane to exchange information between domains, and we propose heuristic approaches for mapping virtual links onto multi-domain optical links using partition and contraction mechanisms on the virtual topology. We provide an integer linear programming formulation to compare with our heuristic approaches. Numerical results show that our heuristic approach is effective in reducing total network cost and increasing the successful mapping rate.

Cost-Effective Survivable Virtual Optical Network Mapping in Flexible Bandwidth Optical Networks

This paper addresses the minimum network cost problem for survivable virtual optical network mapping in flexible bandwidth optical networks. For each virtual link, we provide dedicated-path protection, i.e., primary path and backup path, to guarantee high survivability on the physical network. To simplify the virtual links mapping, an extended auxiliary graph is constructed by coordinating the virtual optical network and the physical network. We develop an integer linear program (ILP) model, the LBSD (the largest bandwidth requirement (LB) of virtual links versus the shortest distance (SD)) mapping approach, the LCSD (the largest computing (LC) resources requirement versus the shortest distance) mapping approach to minimize the network cost for a given set of VONs. For comparison, we also introduce one baseline mapping approach, named LCLC (the largest computing resources requirement versus the largest computing resources (LC) provisioning), and the lower bound. Simulation results show that, comparing to the LCLC mapping approach, the ILP model, the LBSD and LCSD mapping approaches not only solve the problem of minimizing the total network cost but also guarantee that the spectrum usage and the number of regenerators are minimum. The ILP model and the LBSD mapping approach are greatly close to a lower bound of network cost and perform the same results as a lower bound of spectrum usage in both the 6-node network and the 14-node network. As a result, our proposed LBSD mapping approach can efficiently reduce the network cost, spectrum usage, and the number of regenerators, which is near the optimal solutions of the ILP model.

The Framework and Algorithms for the Survivable Mapping of Virtual Network onto a Substrate Network

Network virtualization serves as an effective method for providing a flexible and highly adaptable shared substrate network to satisfy the diversity of demands. However, the problem of efficiently mapping a virtual network onto a substrate network is intractable, as it is NP-hard. How to guarantee survivability of such a mapping efficiently is another great challenge. In this article, we investigate the survivable virtual network mapping (SVNM) problem and propose two kinds of algorithms for solving this problem efficiently. First, we formulate the model with a minimum-cost objective for the survivable network virtualization problem by mixed integer linear programming. We then devise two kinds of algorithms for solving the SVNM problem efficiently: (1) Lagrangian relaxation-based algorithms including LR-SVNM-M and LR-SVNM-D; (2) Heuristic algorithms including H-SVNM-D and H-SVNM-M. The simulation results show that these algorithms proposed in this study can be used to balance the tradeoff between time efficiency and the mapping cost.