Algorithm for virtual nodes reconfiguration on network virtualization

Recently, network virtualization is an emerging trend to address the ossification of the Internet. The key idea of network virtualization is to run multiple architectures simultaneously on a shared substrate. A major challenge in network virtualization is how to assign substrate resources among multiple Virtual Networks (VN) requests efficiently. VN assignment with reconfiguration should be used to accomplish such challenge. Since reconfiguration is much expensive, this paper focuses on reconfiguration with critical virtual nodes by linear programming. Simulation experiments show that the proposed algorithm increases the acceptance ratio by 10% and about 70% of reconfiguration time cost can be spared.