首页> 外文期刊>Intelligent automation and soft computing >Time Efficient Virtual Network Embedding Algorithm
【24h】

Time Efficient Virtual Network Embedding Algorithm

机译:省时的虚拟网络嵌入算法

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

摘要

The virtual network embedding problem is an essential problem in network virtualization. Researchers care about efficiency of the virtual network embedding algorithm. This issue has two procedures: node embedding and link embedding. However, previous studies mainly concentrate on the node embedding while neglecting the link embedding, which is the main cause for the bad running time. In this paper, we propose a new algorithm-Deleting-first algorithm, which deletes incapable substrate links for the current virtual request before link mapping. The efficiency of virtual network embedding will be improved. The simulation results show that the average performance of the new algorithm is better at runtime.
机译:虚拟网络嵌入问题是网络虚拟化中必不可少的问题。研究人员关心虚拟网络嵌入算法的效率。此问题有两个过程:节点嵌入和链接嵌入。但是,以往的研究主要集中在节点嵌入上,而忽略了链路嵌入,这是运行时间较差的主要原因。在本文中,我们提出了一种新的算法,即删除优先算法,该算法在链接映射之前删除当前虚拟请求的无用底材链接。虚拟网络嵌入的效率将得到提高。仿真结果表明,新算法的平均性能在运行时较好。

著录项

  • 来源
    《Intelligent automation and soft computing》 |2016年第2期|273-280|共8页
  • 作者单位

    Beijing Univ Posts & Telecom, State Key Lab Networking & Switching Technol, Beijing, Peoples R China;

    Beijing Univ Posts & Telecom, State Key Lab Networking & Switching Technol, Beijing, Peoples R China;

    Beijing Univ Posts & Telecom, State Key Lab Networking & Switching Technol, Beijing, Peoples R China;

    Beijing Univ Posts & Telecom, State Key Lab Networking & Switching Technol, Beijing, Peoples R China|Jiangsu Future Networks Innovat Inst, Nanjing, Jiangsu, Peoples R China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Virtual network embedding; link mapping; deleting-first half deleting-first; runtime;

    机译:虚拟网络嵌入;链接映射;删除-先删除-先运行;运行时;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号