.png){kind=icon}
返回
Coordinated node and link mapping VNE using a new paths algebra strategy
.png){kind=icon}
OA
AI
DOI：10.1016/j.jnca.2016.02.025.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The main resource allocation research challenge in network virtualization is the Virtual Network Embedding (VNE) Problem. It consists of two stages, usually performed separately: node mapping and link mapping. A new mathematical multi-constraint routing framework for linear and non-linear metrics called paths algebra has already been proposed to solve the second stage, providing good results thanks to its flexibility. Unlike existing approaches, paths algebra is able to include any kind of network parameters (linear and non-linear) to solve VNE in reasonable runtime. While paths algebra had only been used to solve one stage (link mapping) of the VNE, this paper suggests an improvement to solve VNE using the paths algebra-based strategy by coordinating, in a single stage, the mapping of nodes and links based on a ranking made of the bi-directional pair of nodes of the substrate network, ordered by their available resources. Simulation results show that the New Paths Algebra-based strategy shows significant performance improvements when compared against the uncoordinated paths Algebra-based link mapping approach. (C) 2016 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY license .
Keyword:
Network virtualization
Virtual network embedding
Multi-constraint routing
Paths algebra
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8
论文数:
3.7K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
查看更多内容