Robust Dynamical Virtual Network Provisioning

Multiple virtual networks (VNs) sharing an underlying substrate network is considered a promising tool to diversify and reshape the future inter-networking paradigm. In this paper, based on the robust optimization theory, a robust dynamic approach is presented, which periodically identifies bandwidth allocation to VNs to work reasonable well for a range of traffic patterns over a period of time, rather than certain traffic pattern instance. This problem is formulated as a robust optimization problem using path-flow model aiming to compute the minimumcost bandwidth allocation, and a distributed algorithm is proposed by using the primal decomposition method. The numerical result obtained from simulation experiments demonstrates the strength and the effectiveness of the proposed algorithm.