东篱科研大数据发现系统（DRDS）

位置：成果数据库 > 期刊 > 期刊详情页

Topology awareness algorithm for virtual network mapping

ISSN号：1001-3695
期刊名称：《计算机应用研究》
时间：0
分类：TP393[自动化与计算机技术—计算机应用技术;自动化与计算机技术—计算机科学与技术]
作者机构：[1]National Key Laboratory of Parallel and Distributed Processing, National University of Defense Technology. Changsha 410073, China, [2]School of Computer, National University of Defense Technology, Changsha 410073, China, [3]China Electronic Systems Engineering Corporation, Beijing 100039, China, [4]The Northern Institute of Electronic Equipment of China, Beijing 100083, China
相关基金：Project supported by the National Basic Research Program （973） of China （No. 2011CB302601）I the National Natural Science Foundation of China （No. 90818028）, and the National High-Tech R＆D Program （863） of China （No. 2007AA010301 ）

作者： Xiao-ling LI[1,2], Huai-min WANG[1,2], Chang-guo GUO[3], Bo DING[1,2], Xiao-yong LI[1,2], Wen-qi BI[4], Shuang TAN[2]

关键词：网络虚拟化, 骨化, 印射的虚拟网络(VN, ), 底层网络(SN, ), 拓扑学了解, 接受比率, Network virtualization, Ossification, Virtual network （VN） mapping, Substrate network （SN）, Topology awareness Acceptance ratio

中文摘要：

网络虚拟化作为克服因特网的骨化的一个有效方法被认出。然而，印射问题(VNMP ) 的虚拟网络是批评挑战，集中于怎么印射到有基础结构资源的有效利用的底层网络的虚拟网络。这个问题能被划分成二个阶段：节点印射阶段和连接印射阶段。在印射阶段的节点，存在算法通常与完全的贪婪策略印射那些虚拟节点，没有考虑在这些虚拟节点之中的拓扑学，导致太长的底层路径(与多重跳跃) 。处理这个问题，我们建议印射算法的拓扑学了解，它在这些虚拟节点之中考虑拓扑学。在印射阶段的连接，新算法采用 k 短路径算法。模拟结果证明新算法极大地增加长期的平均收入，接受比率，和长期的 revenue-to-cost 比率(R/C ) 。

英文摘要：

Network virtualization is recognized as an effective way to overcome the ossification of the Internet. However, the virtual network mapping problem （VNMP） is a critical challenge, focusing on how to map the virtual networks to the substrate network with efficient utilization of infrastructure resources. The problem can be divided into two phases： node mapping phase and link mapping phase. In the node mapping phase, the existing algorithms usually map those virtual nodes with a complete greedy strategy, without considering the topology among these virtual nodes, resulting in too long substrate paths （with multiple hops）. Addressing this problem, we propose a topology awareness mapping algorithm, which considers the topology among these virtual nodes. In the link mapping phase, the new algorithm adopts the k-shortest path algorithm. Simulation results show that the new algorithm greatly increases the long-term average revenue, the acceptance ratio, and the long-term revenue-to-cost ratio （R/C）.

同期刊论文项目