Modeling and solving for virtual network embedding problem with synchronous node and link mapping

This paper proposes a Virtual Network Mapping algorithm for the unsplittable flow scenario, which maps virtual nodes and virtual links at the same phrase. We formulate the VN embedding problem as a 0-1 linear programming through substrate network augmentation, and then, based on the policy of divide and rule, we solve the model using linear programming, randomized and iterative method. Simulation experiments show that the proposed algorithm increases the acceptance ratio and the revenue while decreasing the cost incurred by the substrate network in the long run.