Virtual Network Mapping Algorithm with Repeatable Mapping over Substrate Nodes

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.