Hao Di

Survivable Virtual Infrastructure Mapping in a Federated Computing and Networking System under Single Regional Failures

As virtualization becomes more and more popular, how to guarantee survivability of a virtual infrastructure (VI) over a wide-area optical network is increasingly important. In this paper, we approach the problem of survivable VI mapping (SVIM) from a few unique perspectives. One of the most distinguishing perspectives is that a large-scale regional failure could destroy one or more facility nodes to which some VI nodes are mapped. Accordingly, redundant facility nodes at different geographical locations and redundant optical connections have to be provisioned such that the VI can still be mapped after the failure. Another distinguishing perspective is that with failure-dependent protection, the SVIM problem can be decomposed into several instances of the basic non-survivable VI mapping (NSVIM) problem, whose solution permits effective sharing of the redundant resources among all failures. In this paper, we first formulate the minimum-cost SVIM problem using mixed integer linear programming (MILP). We then propose an efficient heuristic solution to NSVIM, based on which two novel heuristic SVIM algorithms called Separate Optimization with Unconstrained Mapping (SOUM) and Incremental Optimization with Constrained Mapping (IOCM). Simulations are performed to study and compare the performance of the MILP and heuristics.

A Cost Efficient Design of Virtual Infrastructures with Joint Node and Link Mapping

The virtualization of both servers and substrate networks is a promising technique that will enable the future Internet architecture to support a variety of cloud computing services and architectures. The problem of efficiently mapping a virtual infrastructure (VI) over a wide-area optical network is a key problem in provisioning Infrastructure (and Network) as a Service over multiple datacenters. In this paper, we study the problem of cost efficient VI mapping and propose a novel approach called the virtual infrastructure mapping algorithm (VIMA) that jointly considers node mapping and link mapping. Such a close coordination between the link and node mapping stages increases the efficiency of the VIMA algorithm. We compare the performance of our VIMA algorithm with other VI mapping algorithms such as NSVIM, vnmFlib and R-ViNE under various performance metrics using simulation. Our simulation results and analysis show that the VIMA algorithm outperforms the other algorithms in terms of VI mapping costs and path length of VI links.

Optimal provisioning for virtual network request in cloud-based data centers

Today applications and services are migrating to a cloud-computing-based paradigm in which the users access the applications and services hosted in data centers, by using thin-clients on the user terminal device. These applications/services are typically hosted and run on virtual machines in interconnected data centers. Different applications from the same user may need to access and change shared data or information. Thus, we may abstract the applications from same user as a virtual network (VN). For better performance and efficiency, it is critical that the VN request be accommodated with optimal provisioning under the current resource state of data centers. In this paper, for addressing the issue of how to design an optimal provisioning scheme for the VN request such that the total revenue of is maximized, we first develop a framework for the optimal provisioning of VN request by using mixed integer programming. Since the optimal provisioning problem is NP-hard, we also propose a genetic algorithm–based heuristic algorithm for addressing the problem of optimal provisioning for VN with unsplittable flow and optimal provisioning for VN with splittable flow problems. We demonstrate the effectiveness of our approach in improving the total revenue by conducting extensive simulations on different networks.

Exploring online virtual networks mapping with stochastic bandwidth demand in multi-datacenter

Network virtualization serves as a promising technique for providing a flexible and highly adaptable shared substrate network to satisfy the diversity of demands and overcoming the ossification of Internet infrastructure. As a key issue of constructing a virtual network (VN), various state-of-the-art algorithms have been proposed in many research works for addressing the VN mapping problem. However, these traditional works are efficient for mapping VN which with deterministic amount of network resources required, they even deal with the dynamic resource demand by using over-provisioning. These approaches are obviously not advisable, since the network resources are becoming more and more scarce. In this paper, we investigate the online stochastic VN mapping (StoVNM) problem, in which the VNs are generated as a Poisson process and each bandwidth demand xi follows a normal distribution, i.e., xi ~ N(μi, σ i2). Firstly, we formulate the model for StoVNM problem by mixed integer linear programming, which with objective including minimum-mapping-cost and load balance. Then, we devise a sliding window approach-based heuristic algorithm w-StoVNM for tackling this NP-hard StoVNM problem efficiently. The experimental results achieved from extensive simulation experiments demonstrate the effectiveness of the proposed approach and superiority than traditional solutions for VN mapping in terms of VN mapping cost, blocking ratio, and total net revenue in the long term.

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

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

A new algorithm with coordinated node and link mapping for virtual network embedding based on LP relaxation

Network virtualization is an important technique for designing the future Internet architecture. Virtualization can help diversify the Internet by supporting multiple virtual network services and architectures on a shared substrate [1]. Making efficient use of the underlying substrate network resources requires effective algorithms for virtual network embedding (VNE) that maps each virtual network (VN) to specific nodes and links in the substrate network.

Cost efficient virtual infrastructure mapping using subgraph isomorphism

Network virtualization is a promising solution that can offer more flexibility and prevent Internet ossification without requiring extensive network redesign. Using virtualization multiple heterogeneous virtual network (VN) architectures can cohabit on a shared physical network substrate. Virtualization can be used to run multiple different applications (e.g., operating systems, servers, networking protocols) and also provide customized services suited to the customers needs.

Efficient Online Virtual Network Mapping Using Resource Evaluation

Network virtualization is a promising solution that can prevent network ossification by allowing multiple heterogeneous virtual networks (VNs) to cohabit on a shared substrate network. It provides flexibility and promotes diversity. A key issue that needs to be addressed in network virtualization is allocation of substrate resources for the VNs with respect to their resource requirements and the topologies of the substrate and virtual networks, namely the VN mapping (VNM) problem. Efficient VNM algorithms aim to maximize the number of coexisting VNs, and increase the utilization and revenue obtained from the substrate resources. In this paper, we present an online VNM algorithm (OVNM) that maximizes the number of coexisting VNs leading to good utilization and revenue of the substrate. Using the OVNM algorithm, we estimate the VN mapping and evaluate the associated substrate resources to map the VN within a proper region on the substrate by using the FVN_Sort (first virtual node sorting) function. This improves the probability of a VN mapping success. Furthermore, by mapping the virtual nodes and links in a coordinated fashion, the resource consumption while mapping is minimized. We evaluate the performance of our approach by using simulation, and show that the algorithm has an acceptable run time and leads to a better blocking probability performance, which means more coexisting VNs.

Cost efficient virtual network mapping across multiple domains with joint intra-domain and inter- domain mapping

Abstract Network virtualization allows the coexistence of multiple virtual networks on a shared substrate optical network, which interconnects the geo-distributed data centers. A virtual network (VN) typically spans across multiple domains, which may be managed by different infrastructure providers (InPs). The topology and resource information on each domain is confidential and kept private by the InP. However, a domain-level (global) view is required to achieve cost efficient VN mapping across multiple domains. In this paper, we present a framework for the cost efficient VN mapping across multiple domains with joint intra-domain and inter-domain mapping. In the framework, the VN mapping is accomplished by the mapping manager that is the broker between the SPs and the InPs. The mapping manager collects the mapping candidates for the VN request from the InPs, and then establishes the abstracted domain-level graph. Finally the candidates are selected on the domain-level graph with cost and quality of services (QoS) consideration. We formulate the problem of candidate selection as an mixed integer linear programming (MILP), and then relax the integer constraints to obtain a linear program to solve it. The simulation results show that our proposed framework can achieve low resource allocation cost and good QoS performance for the VN request.

Design of reliable virtual infrastructure using local protection

Network virtualization technology wherein multiple virtual infrastructures (VIs) are supported on the same underlying infrastructure is the key enabler of the cloud computing paradigm. However, due to the resource sharing, even a single server failure in the substrate will affect all the VIs mapped on to it. Thus, backup resources should be reserved intelligently to provide cost-effective VI reliability. In this paper, we study the problem of reliable VI mapping over multiple clusters. We propose a local protection scheme to minimize the total reliable mapping cost, i.e., each VI node is protected in a local cluster so that the high backup bandwidth cost on the wide-area network can be avoided. We present our local protection based reliable VI mapping algorithm (LP-RVIM) to minimize the mapping cost for VIs with protection. Through simulations we show that our LP-RVIM algorithm can efficiently reduce the mapping costs when compared to other VI mapping algorithms.