检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵徐炎 崔允贺 钱清 郭春[1,2,3] 申国伟 ZHAO Xuyan;CUI Yunhe;QIAN Qing;GUO Chun;SHEN Guowei(College of Computer Science and Technology,Guizhou University,Guiyang 550025,China;State Key Laboratory of Public Big Data Co-built by Provincial and Ministry,Guizhou University,Guiyang 550025,China;Engineering Research Center of Text Computing and Cognitive Intelligence,Ministry of Education,Guizhou University,Guiyang 550025,China;College of Information,Guizhou University of Finance and Economics,Guiyang 550025,China)
机构地区:[1]贵州大学计算机科学与技术学院,贵阳550025 [2]贵州大学省部共建公共大数据国家重点实验室,贵阳550025 [3]贵州大学文本计算与认知智能教育部工程研究中心,贵阳550025 [4]贵州财经大学信息学院,贵阳550025
出 处:《计算机工程》2023年第8期154-162,共9页Computer Engineering
基 金:国家自然科学基金(62102111);贵州省科技计划项目(黔科合基金[2020]1Y267);贵州省普通高等学校青年科技人才成长项目(黔教合KY字[2021]136);贵州大学引进人才科研项目(贵大人基合字(2019)52号)。
摘 要:为响应租户的虚拟机使用请求,云数据中心通常从物理服务器中选择虚拟机放置服务器,随后计算租户与所选择的虚拟机放置服务器之间的路由路径以承载两者之间的流量。但是这种顺序的处理方式使得虚拟机放置服务器的计算过程难以考虑其对网络造成的影响,可能导致网络利用率降低甚至出现网络拥塞。为解决该问题,提出一种虚拟机及路由路径联合部署算法VENet。VENet通过添加虚拟交换机及虚拟链路将原网络拓扑扩展为虚拟网络拓扑,基于该虚拟扩展网络拓扑,将虚拟机及路由路径联合部署问题近似为商品流问题,即将虚拟机请求近似为从相应接入起点交换机到虚拟目的交换机之间的商品流,对该商品流问题进行建模,通过线性规划的方式求解该模型,即可同时获得虚拟机放置位置及相应的路由路径。实验结果表明,VENet算法能够提高数据中心可接受的虚拟机请求数上限,缩短租户与虚拟机部署位置之间的路由路径长度同时降低数据中心的网络负载率,路由路径长度和网络负载率相比WLC-GA算法分别降低42%和30%。In response to a tenant's request for virtual machine usage,cloud data centers typically select a physical server for virtual machine placement and calculate the routing path between the tenant and the selected virtual machine placement server to carry traffic between them.However,it is hard to predict the impact of virtual machine placement on the network,and this sequential virtual machine placement can result in the inefficient use of network resource and congestion.To address this problem,a virtual machine and routing path joint placement algorithm,VENet,is proposed.VENet expands the original network topology into a virtual network topology by adding virtual switches and links.Based on this virtual extended network topology,the joint placement problem is approximated as a commodity flow problem,where virtual machines requests are represented as a commodity flow between the corresponding access point switch and the virtual destination switch.The commodity flow problem is modeled and solved through linear programming,obtaining the virtual machine placement location and corresponding routing path simultaneously.Experimental results show that VENet can improve the upper limit of the number of virtual machine requests that can be accepted by the data center,shorten the routing path length between the tenant and the virtual machine placement location,and reduce the network load rate of the data center.Compared to the Weighted Least Connection-Genetic Algorithm(WLC-GA),VENet reduces the routing path length and network load rate by 42%and 30%,respectively.
关 键 词:虚拟机放置 路由路径 拓展网络拓扑 商品流 软件定义网络
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222