A Study on Virtual Network Decomposing Mapping Algorithm Based on Network Balance

Dealing with the problem of virtual network (VN) mapping in the environment of network virtualization, this paper proposes a decomposing mapping algorithm that generally focuses on the remaining network balance. The algorithm first decomposes a request of VN mapping into meta-requests, each of which is consisted of a pair of nodes and a virtual link. The second step is to search out a path set which meets the aforementioned meta-requests. From such a set, the algorithm selects a path that can achieve a relative balance of the remaining resources. Combining shortest-path algorithm and the depth first search strategy, our algorithm can find out a path that enables the remaining network to maintain a minimum degree of equilibrium. Minimizing the expense of VN construction, our algorithm at the same time pays an attention to the remaining resource balance of the substrate network. Compared with the overall planning based on multi-commodity flow and another approach that simply uses shortest-path algorithm, simulation results show that the proposed algorithm can improve the acceptance ratio of virtual network mapping requests.