virtual network embedding with coordinated node and link mapping

Virtual network embedding with coordinated node and link mapping

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Virtual Network Embedding with Coordinated Node and Link Mapping N. M. Mosharaf Kabir Chowdhury Cheriton School of Computer Science University of Waterloo Waterloo, Canada Email: [email protected] Muntasir Raihan Rahman Cheriton School of Computer Science University of Waterloo Waterloo, Canada Email: [email protected] Raouf Boutaba Cheriton School of Computer Science University of Waterloo Waterloo, Canada Email: [email protected] Abstract —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 heuristic- based 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 em- bedding 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 algo- rithms D-ViNE and R-ViNE using deterministic and randomized rounding techniques, respectively. Simulation experiments show that the proposed algorithms increase the acceptance ratio and the revenue while decreasing the cost incurred by the substrate network in the long run. I. INTRODUCTION Since its inception, the Internet has proven its worth by supporting myriad distributed applications and heterogeneous networking technologies. However, due to the existence of multiple stakeholders with conflicting goals and policies, alter- ations, even necessary ones, to the present architecture have now become almost impossible to achieve. To fend off the rigidity of the existing Internet once and for all, network virtualization has been propounded as a fundamental diversify- ing attribute of the future inter-networking paradigm that will allow multiple heterogeneous network architectures to coexist on a shared substrate [1], [2]. In a network virtualization environment (NVE), multiple service providers (SPs) will be able to create heterogeneous virtual networks (VNs) to offer customized end-to-end services to the end users by leasing shared resources from one or more infrastructure providers (InPs) without significant investment in physical infrastructure [2]–[4]. Each VN in an NVE is a collection of virtual nodes (e.g., virtual routers) that are hosted on different substrate nodes and interconnected by physical paths in the substrate network corresponding to virtual links. Since multiple VNs can share the same underlying physical resources, efficient and effective embedding/mapping/assignment 1 of each of the online VN requests is of utmost importance in order to increase...
View Full Document

{[ snackBarMessage ]}

Page1 / 9

Virtual network embedding with coordinated node and link mapping

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online