In order to solve the problem that the existing virtual network embedding algorithm ignores the attributes of the network itself and allocates resources only according to the order of request arrivals, which leads to the low utilization rate of physical resources, this paper proposes a virtual network embedding algorithm based on double priority sorting by using the time window model. In the first sorting, while coarsening the virtual network request, the priority of the request is calculated according to the service type and attribute parameters, and the mapping order of the virtual network in the window is preliminarily determined. In the second sorting, the priority is determined by the link weight, and the best mapping path is calculated by comprehensively considering the link bandwidth resource demand and node path hops. The simulation results show that the algorithm reduces the average waiting time of virtual network requests, and improves the request receiving rate and the revenue-cost ratio.