面向文件存储的虚拟网络映射算法

Virtual network mapping alogorithm for file storage

研究了将含有文件需求的虚拟网络请求映射到有存储的物理网络上。针对该研究,提出一种基于节点连通性和广义网络单纯形法的虚拟网络映射算法S-VNM。在节点映射阶段,对虚拟节点按照资源需求进行排序,然后根据节点连通性和映射成本来选择映射节点。在链路映射阶段,采用广义网络单纯形法求解映射成本问题。通过MATLAB进行实验仿真,实验结果表明,S-VNM算法在映射成本和算法运行时间综合考虑的情况下性能最优。

The content of this paper is to map virtual network requests containing file requirements to the underlying network with storage. Virtual network mapping algorithm S-VNM is proposed based on node connectivity and generalized simplex algorithm. In the stage of node mapping,virtual nodes are ranked according to resources requirements and search order,then the mapping node is chosen according to the node connectivity and mapping costs. In the stage of link mapping,the process is equivalent to the mapping cost problem which can be solved by the generalized network simplex algorithm. Experiments were simulated by MATLAB. The experimental results show that the S-VNM algorithm has the best performance under the consideration of mapping cost and running time.