Virtual Network Embedding with Coordinated Node and Link Mapping

—Recently network virtualization has been proposed as a promising way to overcome the current ossification of the Internet by allowing multiple heterogeneous virtual networks (VNs) to coexist on a shared infrastructure. A major challenge in this respect is the VN embedding problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. Since this problem is known to be NP-hard, previous research has focused on designing heuristicbased algorithms which have clear separation between the node and link mapping phases. This paper proposes VN embedding algorithms with better coordination between the two phases. We formulate the VN embedding problem as a mixed integer program through substrate network augmentation. We then relax the integer constraints to obtain a linear program, and devise two VN embedding algorithms D-ViNE and R-ViNE using deterministic and randomized rounding techniques, respectively. Simulation experiments show that t...

• Type: Conference
• Year: 2009
• Where: INFOCOM
• Authors: N. M. Mosharaf Kabir Chowdhury, Muntasir Raihan Rahman, Raouf Boutaba
• Keywords: Communications, INFOCOM 2009, Substrate Network, VN Embedding Algorithms, VN Embedding Problem