K-核分解的虚拟网络映射算法

Virtual Network Embedding Algorithm Based on K-core Decomposition

网络虚拟化是解决现有僵化网络结构的一项重要技术,如何有效地进行虚拟网络映射是其面临的关键问题.针对要求即时响应的虚拟网络请求,分析了基于网络位置属性的节点重要性排序,定义了底层网络节点中继能力,并提出了基于K-核分解的虚拟网络映射算法.该算法首先按照节点中继能力大小构建并周期性更新中继传输子网,然后在简化后的底层网络上进行虚拟网络映射,降低了资源映射的复杂度.仿真实验结果表明,与现有的主流研究成果相比,该算法显著地减少了虚拟网络请求响应时间.

Network virtualization is recognized as a significant technology to solve the ossification of current Internet architecture. The main problem of network virtualization is how to map the virtual network effectively. In order to reply the request of the virtual net- work in real time, a new virtual network mapping algorithm based on the K-Core decomposition is presented with the definition of the nodes＇ relay ability in the underlying network,and also we analyze the sequence of the nodes＇ importance based on the property of the network site. The algorithm first build and update the relay transmission subnets periodically based on the ability of the relay nodes. And then map the virtual network in the simplified underlying network. The algorithm can reduce the complexity of resource mapping effectively. The experiment results show that the algorithm can decrease the response time of the virtual network request effectively when compared with the current algorithms.