云计算环境下基于拓扑感知的虚拟网络映射研究

发布时间：2018-09-03 13:10

【摘要】：网络虚拟技术被认为是克服Internet僵化的一种有效方法,特别是在云计算的环境下。但是虚拟网络映射问题(VNMP)是一个最主要的挑战,其主要是如何通过一种有效的方式将虚拟网络映射到底层网络上从而有效地利用底层的基础资源。虚拟网络映射可以分为两个阶段:节点映射以及链接映射。在节点映射阶段,现有的算法通常使用完全的贪婪策略映射这些虚拟节点,而不考虑这些虚拟节点的拓扑,这将导致底层路径太长(有多个跳跃点)。为解决这一问题,提出一个拓扑感知的节点映射算法,该算法在进行映射时考虑节点的拓扑结构。在链接的映射阶段,新的算法采用k最短路径算法。模拟结果显示,新算法大大增加长期的平均收益,而接受的比率和长期的收益与成本(R/C)成比例。
[Abstract]:Network virtual technology is considered to be an effective way to overcome Internet fossilization, especially in cloud computing environment. However, the problem of virtual network mapping (VNMP) is one of the most important challenges. It mainly focuses on how to map the virtual network to the underlying network in an effective way to make effective use of the underlying basic resources. Virtual network mapping can be divided into two stages: node mapping and link mapping. In the phase of node mapping, the existing algorithms usually map these virtual nodes using a completely greedy strategy, regardless of the topology of these virtual nodes, which results in the lower path being too long (with multiple hopping points). In order to solve this problem, a topology aware node mapping algorithm is proposed, which takes into account the node topology when mapping. In the mapping phase of link, the new algorithm adopts k shortest path algorithm. The simulation results show that the new algorithm greatly increases the long-term average income, while the accepted rate and the long-term income are proportional to the cost (R / C).
【作者单位】：铁道警察学院公安管理系;
【基金】：国家自然科学基金项目(U1204613)
【分类号】：TP393.01

【共引文献】