基于可生存虚拟网络的混合可靠映射算法提升网络虚拟化效率

70 浏览量更新于2024-08-27 收藏 2.1MB PDF 举报

本文主要探讨了"基于可生存虚拟网络的混合可靠启发式映射方法用于网络虚拟化"这一主题。在现代网络虚拟化环境中，确保虚拟网络的可靠性和服务连续性是一项关键挑战。传统的保护机制往往依赖于冗余和恢复策略，然而，这种方法可能会增加底层物理网络的成本和复杂性。研究者们提出了Hybrid-RHM-SVN（Hybrid Reliable Heuristic Mapping Method Based on Survivable Virtual Networks），这是一种创新的方法，它将可靠性映射问题转化为整数线性编程问题。该方法的核心思想是借鉴可生存虚拟拓扑路由的概念，即设计出即使在网络中出现单个节点故障也能保持虚拟网络连通性的映射策略。这有助于在面对潜在的节点失效时，维持虚拟网络的服务可用性。具体实施步骤包括： 1. 故障节点分析：首先，通过识别故障节点对虚拟网络的影响，确定需要保护的关键部分，这涉及到找到虚拟网络子图的主割集，即最小的边集合，当其被切断时会使得子图无法保持连通性。 2. 启发式优化：利用蚁群优化算法进行近似求解。这种算法模仿蚂蚁寻找食物的行为，通过不断迭代、评估和更新解空间，寻找最接近全局最优的映射方案。在选择初次切割集中的链接时，特别考虑不通过最先移除的虚拟节点对应的基础节点的路径，以减少网络的负担。 3. 性能评估：通过仿真，Hybrid-RHM-SVN与现有的可靠映射算法进行了对比。结果显示，该方法在提升虚拟网络的接纳率、映射的平均收益以及虚拟网络的恢复能力方面表现出优势，这表明它在兼顾效率和成本的同时，提供了更高的网络可靠性。总结来说，这篇研究论文引入了一种新颖的网络虚拟化映射策略，它不仅关注网络的冗余和恢复，还强调了在基础网络资源有限的情况下保持虚拟网络服务连续性的可生存性设计。通过实验证明，Hybrid-RHM-SVN在保证服务质量的同时，提高了资源利用率，对于网络设计者和运营商来说，具有实际的应用价值和理论意义。

Research Article

A Hybrid Reliable Heuristic Mapping Method Based on

Survivable Virtual Networks for Network Virtualization

Qiang Zhu,

Hui-Qiang Wang,

Guang-Sheng Feng,

Hong-Wu Lv,

Zhen-Dong Wang,

Xiu-Xiu Wen,

and Wei Jiang

College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China

FacultyofInformationEngineering,JiangxiUniversityofScienceandTechnology,Ganzhou341000,China

Correspondence should be addressed to Qiang Zhu; zhuqianghrbeu@163.com

Received 19 October 2014; Revised 8 December 2014; Accepted 16 December 2014

Academic Editor: Muhammad Naveed Iqbal

which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

e 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. en, we use the ant

colony optimization algorithm to achieve the approximate optimal mapping. e 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 rst. e 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.

1. Introduction

Due to the “best eort” service model of the Internet, cloud

computing is facing challenges in service diversity providing.

Network virtualization is an eective technique to solve this

problem [1–3]. Network virtualization allows multiple inde-

pendent virtual networks cohabiting on a shared substrate

network, which can quickly and cost-eectively carry out

new types of business and technologies [4]. Virtual network

requests consisting of virtual nodes and virtual links with

resource constraints are generated by users. How to provide

reasonable substrate network resources allocation for virtual

network requests is called virtual network mapping, which

hasbeenprovedtobeaNP-hardproblem[5, 6].

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

phism detection based mapping algorithm [11], path splitting

and migration [12], and other heuristic algorithms [13–15],

without considering with the reliability of the mapped virtual

networks. However, the nodes and the links in substrate

network are inevitably aected by internal and external

inuences in actual situation, undermining the continuity of

virtual network services.

Tosolvethereliablevirtualnetworkmappingprob-

lem, previous researches mainly use protection mechanisms

[16]. Rahman and Boutaba [17] proposed a hybrid strategy

heuristic algorithm by utilizing a prereserved quota for

backing up on each substrate link. In order to reduce the

redundant backup resources, Yu et al. [18]proposedamethod

that nodes and links are backed up in dierent areas for

virtual networks, which requires virtual nodes to transmit

the current states to the backup nodes and exacerbates

substrate network resources consumption. Yeow et al. [19]

proposed an optimizing redundancy pool to allocate backup

Hindawi Publishing Corporation

Discrete Dynamics in Nature and Society

Volume 2015, Article ID 316801, 8 pages

http://dx.doi.org/10.1155/2015/316801

下载后可阅读完整内容，剩余8页未读，立即下载

weixin_38738511

粉丝: 3
资源: 898

基于可生存虚拟网络的混合可靠映射算法提升网络虚拟化效率

2012A-Virtual Network Embedding Algorithms

在光和数据中心网络中嵌入面向混合云渲染的虚拟网络

DxR：DXR是一个Unity软件包，用于在增强，混合和虚拟现实（AR，MR，VR）或简称XR中快速构建沉浸式数据可视化的原型

在云环境中以最少的成本进行多资源工作负载映射

云计算中的基于ACA-GA的资源调度的研究.pdf

基于线性规划松弛的虚拟网络映射算法

VNE-UEPSO：一种统一增强粒子群优化的虚拟网络嵌入算法

三维模型的UV映射技术入门

OpenCV物体识别在虚拟现实领域的应用：创造沉浸式体验的魔法

计算机网络与局域网构建：网络拓扑规划策略

最新资源