School of Information Science and Engineering, Guangxi University for Nationalities, Nanning, China; Chengdu Institute of Computer Application, Chinese Academy Of Sciences, Chengdu, China; Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis, Nanning, China

---

Abstract—Based on the previous research, a virtual network mapping algorithm with repeatable embedding over substrate nodes is summarized, in which, the virtual nodes in the same virtual network may be assigned to the same substrate node so that some virtual links don’t need to be mapped to reduce the substrate link costs and improve the mapping effectively. Additionally, in the link mapping process, path splitting is introduced to make best use of some low bandwidth to make more virtual networks mapped, which is similar to the multi-commodity flow problem. Meanwhile, we classify the virtual network requests before mapping, map the virtual networks without link splitting request firstly and assign those with it secondly. The experimental results show that the proposed algorithm and the improved scheme perform better in mapping percentage, acceptance percentage and revenue.

Index Terms—Virtual network, Mapping algorithm, Path splitting, Sort preprocessing

[PDF]

Cite: Yong Huang and Jinzhao Wu, " Research on Virtual Network Mapping Algorithm with Path Splitting Based on Sort Preprocessing," Journal of Computers vol. 8, no. 9, pp. 2413-2420, 2013.