检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘新刚[1] 怀进鹏[1] 高庆一[1] 沃天宇[1]
机构地区:[1]北京航空航天大学计算机学院,北京100191
出 处:《计算机学报》2012年第12期2492-2504,共13页Chinese Journal of Computers
基 金:国家"九七三"重点基础研究发展规划项目基金(2011CB302602);国家自然科学基金(91118008;90818028);国家"八六三"高技术研究发展计划项目基金(2011AA01A202)资助~~
摘 要:虚拟网络映射是网络虚拟化中最基本的问题之一.虚拟网络映射可分解成结点映射和链路映射两个阶段,之前的研究更加侧重于链路映射,对结点映射只采取简单的方式进行,不利于资源利用率的提高.之前的结点映射方法有两个主要问题:(1)优先占用带宽较大的结点,不利于资源的合理配置;(2)将结点映射与链路映射完全分隔处理,逻辑相邻的虚拟结点可能映射到分散的物理结点上,致使虚拟链路占用更多的网络资源.文中提出一种结点紧凑的虚拟网络映射方法,将所有符合条件的物理结点都作为虚拟结点的候选宿主,扩大了宿主的选择空间,有利于资源的合理配置;同时选择那些分布紧凑的结点作宿主,将相邻的虚拟结点映射到邻近的物理结点之上,减少虚拟链路对网络资源的占用.实验结果表明:文中方法可以提高资源的利用率,并显著地提高了虚拟网络请求的接受率.Virtual Network (VN) embedding is one of the key problems of network virtualiza- tion. It can be separated into two basic phases, the node mapping and the link mapping phases. Previous research mainly focused on the link mapping phase, while there are only few simple and crude solutions in node mapping phase. However, the result of node mapping has a significant impact on the performance of virtual network embedding. There are two major drawbacks of pre- vious node mapping solutions. Firstly, nodes with sufficient bandwidth resources are first select- ed while finding the hosts, which is not good for resource utilization usually. Secondly, existing methods separate the two phases too clearly so that neighbor nodes in the virtual network may be mapped to faraway nodes in the substrate network, which causes virtual links to take more band- width resources. This paper proposes a new virtual network embedding algorithm with node dis- tributed closely. We take all the substrate nodes that meet a virtual node's requirement as its candidate hosts, so that there are more choices while selecting its host. It is conducive to rational allocation of resources. After that, we choose those closely distributed substrate nodes as the hosts of the virtual nodes, and those adjacent nodes in the virtual network request are mapped to substrate nodes in neighborhood. As a result, fewer resources are needed to finish link mapping. Simulation experiments show that the proposed algorithm improves resource utilization and increases the acceptance ratio significantly.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.40