中文摘要：

该文在已有的映射算法基础上,结合K短路径的思想,改进了链路映射过程。算法通过多次搜索K短路径,寻找满足虚链路带宽需求的物理路径,有效地提高了虚链路的映射率。同时,根据虚拟网映射特性,针对节点映射过程,提出了物理节点可重复映射的映射算法,即在同一虚拟网映射过程中,物理节点可接受多个虚节点的映射。算法不仅减少了部分虚链路的映射过程,降低了映射的复杂度,而且节约了链路映射的成本,使物理网可以接收更多的虚拟网请求,有效地提高了映射效率。模拟实验表明,算法在执行时间、映射成功率以及映射收益等指标上都有着明显优势。

英文摘要：

Based on the previous research,a new algorithm with the K-shortest path is proposed.This algorithm searches the K-shortest path for increasing K,and stops the search if one with enough bandwidth capacity is found.The search process enhances the percentage of link mapping effectively.In addition,according to the rules of node mapping in general algorithm,a new virtual network mapping algorithm with repeatable mapping over substrate nodes is put forward,in which,multiple virtual nodes in the same virtual network can be mapped to the same node in the substrate network if there is enough resource capacity.That not only cuts down some virtual link mapping processes and reduces the mapping time,but also saves the substrate link cost and makes more virtual networks mapped.Experiments show that the new algorithm performs better in mapping percentage,time and mapping revenue.