论文部分内容阅读
网络虚拟化是解决现有僵化网络结构的一项重要技术,如何有效地进行虚拟网络映射是其面临的关键问题.针对要求即时响应的虚拟网络请求,分析了基于网络位置属性的节点重要性排序,定义了底层网络节点中继能力,并提出了基于K-核分解的虚拟网络映射算法.该算法首先按照节点中继能力大小构建并周期性更新中继传输子网,然后在简化后的底层网络上进行虚拟网络映射,降低了资源映射的复杂度.仿真实验结果表明,与现有的主流研究成果相比,该算法显著地减少了虚拟网络请求响应时间.
Network virtualization is an important technology to solve the existing rigid network structure, and how to effectively map the virtual network is a key issue that it faces.Aiming at the request of virtual network for immediate response, this paper analyzes the order of node importance based on the network location attribute , Defines the relay capability of the underlying network node, and proposes a virtual network mapping algorithm based on K-kernel decomposition.The algorithm firstly constructs and periodically updates the relay transport subnet according to the relay relay capacity, and then, after the simplified bottom layer The virtual network mapping on the network reduces the complexity of the resource mapping.The simulation results show that compared with the existing mainstream research results, this algorithm significantly reduces the virtual network request response time.