期刊名称：International Journal of Grid and Distributed Computing
印刷版ISSN：2005-4262
出版年度：2016
卷号：9
期号：9
页码：419-432
DOI：10.14257/ijgdc.2016.9.9.35
出版社：SERSC
摘要：Recent studies for network virtualization have shown a promising way to overcome the Internet ossification. The one of the key issues in network virtualization is a virtual network mapping problem, i.e., mapping a virtual network to the physical network. The situations of dynamic arrivals of virtual network request and the limited life cycle of the virtual networks pose significant challenges to the virtual network mapping problem. A balance between the resource allocation of the physical network and the number of mapped virtual networks. In this paper, we have considered the time characteristics that virtual network requests when mapping algorithms so as to achieve the objective that the node load and link load can simultaneously reach a balance. Giving full consideration to mutual restraints of time and resources, we propose a two-dimensional discrete weighted model based on time and resources, and establish a mathematical programming model of minimizing the degree of two-dimensional load balancing . Moreover, we devise a VN embedding algorithms LB- VNE. Simulation experiments show that the proposed algorithms can increase the acceptance ratio and the revenue by the substrate network in the long term.
