...
首页> 外文期刊>Scientific programming >VR-Cluster: Dynamic Migration for Resource Fragmentation Problem in Virtual Router Platform
【24h】

VR-Cluster: Dynamic Migration for Resource Fragmentation Problem in Virtual Router Platform

机译:VR-Cluster:虚拟路由器平台中资源分散问题的动态迁移

获取原文
获取原文并翻译 | 示例

摘要

Network virtualization technology is regarded as one of gradual schemes to network architecture evolution. With the development of network functions virtualization, operators make lots of effort to achieve router virtualization by using general servers. In order to ensure high performance, virtual router platform usually adopts a cluster of general servers, which can be also regarded as a special cloud computing environment. However, due to frequent creation and deletion of router instances, it may generate lots of resource fragmentation to prevent platform from establishing new router instances. In order to solve "resource fragmentation problem," we firstly propose VR-Cluster, which introduces two extra function planes including switching plane and resource management plane. Switching plane is mainly used to support seamless migration of router instances without packet loss; resource management plane can dynamically move router instances from one server to another server by using VR-mapping algorithms. Besides, three VR-mapping algorithms including first-fit mapping algorithm, best-fit mapping algorithm, and worst-fit mapping algorithm are proposed based on VR-Cluster. At last, we establish VR-Cluster protosystem by using general X86 servers, evaluate its migration time, and further analyze advantages and disadvantages of our proposed VR-mapping algorithms to solve resource fragmentation problem.
机译:网络虚拟化技术被视为网络架构演进的渐进方案之一。随着网络功能虚拟化的发展,运营商为使用通用服务器实现路由器虚拟化付出了很多努力。为了确保高性能,虚拟路由器平台通常采用一组通用服务器,这也可以视为一种特殊的云计算环境。但是,由于频繁创建和删除路由器实例,它可能会产生大量资源碎片,从而阻止平台建立新的路由器实例。为了解决“资源分割问题”,我们首先提出VR-Cluster,它引入了两个额外的功能平面,包括交换平面和资源管理平面。交换平面主要用于支持路由器实例的无缝迁移而不会丢失数据包;资源管理平面可以使用VR映射算法将路由器实例从一台服务器动态移动到另一台服务器。此外,提出了基于VR-Cluster的三种虚拟现实映射算法,包括首次拟合映射算法,最佳拟合映射算法和最差拟合映射算法。最后,我们使用通用的X86服务器建立了VR-Cluster原型系统,评估了其迁移时间,并进一步分析了我们提出的VR-mapping算法解决资源碎片化问题的优缺点。

著录项

  • 来源
    《Scientific programming 》 |2016年第1期| 3976965.1-3976965.14| 共14页
  • 作者单位

    Natl Univ Def Technol, Coll Comp, Changsha 410073, Hunan, Peoples R China;

    Natl Univ Def Technol, Coll Comp, Changsha 410073, Hunan, Peoples R China;

    Natl Univ Def Technol, Coll Comp, Changsha 410073, Hunan, Peoples R China;

  • 收录信息 美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号