Abstract

The reliable mapping of virtual networks is one of the hot issues in network virtualization researches. Unlike the traditional protection mechanisms based on redundancy and recovery mechanisms, we take the solution of the survivable virtual topology routing problem for reference to ensure that the rest of the mapped virtual networks keeps connected under a single node failure condition in the substrate network, which guarantees the completeness of the virtual network and continuity of services. In order to reduce the cost of the substrate network, a hybrid reliable heuristic mapping method based on survivable virtual networks (Hybrid-RHM-SVN) is proposed. In Hybrid-RHM-SVN, we formulate the reliable mapping problem as an integer linear program. Firstly, we calculate the primary-cut set of the virtual network subgraph where the failed node has been removed. Then, we use the ant colony optimization algorithm to achieve the approximate optimal mapping. The links in primary-cut set should select a substrate path that does not pass through the substrate node corresponding to the virtual node that has been removed first. The simulation results show that the acceptance rate of virtual networks, the average revenue of mapping, and the recovery rate of virtual networks are increased compared with the existing reliable mapping algorithms, respectively.

Highlights

  • Due to the “best effort” service model of the Internet, cloud computing is facing challenges in service diversity providing

  • Previous researches on the virtual network mapping problem are almost concerned with the acceptance rate, the resource utilization, and the average revenue of the substrate network with no fault, such as ViNEYard algorithm [7], RW-BFS algorithm [8], DVNMA algorithm [9], distributed virtual network mapping algorithm [10], subgraph isomorphism detection based mapping algorithm [11], path splitting and migration [12], and other heuristic algorithms [13,14,15], without considering with the reliability of the mapped virtual networks

  • Inspired by the survivable routing in wavelength division multiplexing WDM optical network in literature [22], we propose the concept of survivable virtual network, which is different from traditional protection mechanisms and recovery mechanisms

Read more

Summary

Introduction

Due to the “best effort” service model of the Internet, cloud computing is facing challenges in service diversity providing. To solve the reliable virtual network mapping problem, previous researches mainly use protection mechanisms [16]. Butt et al [20] proposed a topology-awareness and reoptimization mechanism based on node migration and link remapping, which does not provide virtual networks with redundancies. The literature [21] uses a recovery mechanism to deal with the reliable virtual network mapping problem. When the substrate network is under a node failure, the rest of the mapped virtual networks needs to remain connected to ensure the continuity of virtual network services and uses the node migration and link remapping to repair the affected virtual networks. In order to reduce the cost of the substrate network, a hybrid reliable heuristic mapping method based on survivable virtual networks is proposed. The links in the primary-cut set should be selected from the substrate paths that do not pass through the substrate node corresponding to the virtual node that has been removed first

Reliable Virtual Network Mapping Formulation
Integer Linear Programming Formulation
Constraints
Nodes Allocation Strategy
Links Allocation Strategy
Performance Evaluation
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call