基于广度优先搜索的虚拟网络映射算法

中文摘要: 针对虚拟网络映射中的资源分配问题，通过建立节点资源度量模型，采用图的广度优先搜索遍历方法和节点同步遍历策略，依次将虚拟网络中相邻的虚拟节点映射到物理网络中邻接的物理顶点上，协调完成虚拟节点和虚拟链路的映射操作，降低虚拟链路的映射路径长度。仿真实验表明，提出的BFS-VNM算法有效地降低了虚拟链路扩张因子，提高了网络收益与开销比和虚拟网络请求接受率。
Abstract:Aiming to the resources allocation problem of embedding virtual networks onto the substrate network,a metric model of the network nodes’ resources was proposed.The breadth-first search method of traversing graphs,and the synchronization strategy of traversing virtual and substrate nodes were used,then adjacent nodes in the virtual network were embedded onto the neighbor nodes in the substrate network in their turn.Moreover,virtual nodes and virtual links were embedded in a coordinated way,and the embedding paths’ length of the virtual links were decreased evidently.Simulation results showed that the BFS-VNM algorithm reduces the scaling factor of virtual links effectively,and increases the network revenue-to-cost ratio and the acceptance ratio of virtual network requests.