An approach towards resource efficient virtual network embedding

Network virtualization is at the heart of efforts to end Internet ossification, and utilize network infrastructure efficiently. The key concept is to share the infrastructure resources among many users at the same time and in such a way to enable them to deploy the required architectures. This leads to virtual networks (VNs), demanding different resources that have to be embedded on the underlying shared infrastructure network. The requirements of a VN can be based on factors such as, the type of traffic it needs to carry. Some portion of the same resources (substrate resources) needs to be assigned to every VN and the substrate resources are also finite. Thus, a mechanism needs to be devised in order to schedule the resources. This embedding process with resource constraints on virtual nodes and links to be applied on the substrate, which also has limited resources, is challenging and corresponds to the category of NP-hard problems. In this paper, we propose an approach to solve this problem by mapping the vertices of the VN as closely as possible in the substrate network and then assigning virtual edges to the shortest paths which satisfy their demands. This could enable the substrate to accommodate more VNs in the same resource database and hence optimize the substrate's bandwidth utilization. To the best of our knowledge closest node mapping proposed in this solution is a novel approach and is evaluated and compared to the existing approach of greedy node mapping in different scenarios. The sensitivity analysis by varying the different parameters and their effect on mapping VNs is also presented.© 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works

Minimizing bottleneck nodes of a substrate in virtual network embedding

Network virtualization has been proposed as a way to increase the flexibility of the Internet. This could enable the provisioning of many desired services in the current architecture and allow effective sharing and use of resources. Providing virtual networks (VNs) means that virtual nodes and links need to be embedded in the underlying shared infrastructure. This embedding process, where VNs with resource demands are mapped onto a substrate with finite resources is a challenging and NP-hard problem. In this paper the focus is on mapping the VNs in such a way that node resources in the substrate are not completely exhausted. To achieve this objective, an approach referred to as bottleneck node reduced mapping is presented. This method is evaluated and compared with an approach, where resource exhaustion is not considered.© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 2012020

Virtual Network Embedding : A Hybrid Vertex Mapping Solution for Dynamic Resource Allocation

Virtual network embedding (VNE) is a key area in network virtualization, and the overall purpose of VNE is to map virtualnetworks onto an underlying physical network referred to as a substrate. Typically, the virtual networks have certain demands,such as resource requirements, that need to be satisfied by the mapping process. A virtual network (VN) can be described in termsof vertices (nodes) and edges (links) with certain resource requirements, and, to embed a VN, substrate resources are assigned tothese vertices and edges. Substrate networks have finite resources and utilizing them efficiently is an important objective for a VNEmethod. This paper analyzes two existing vertex mapping approaches—one which only considers if enough node resources areavailable for the current VN mapping and one which considers to what degree a node already is utilized by existing VN embeddingsbefore doing the vertex mapping. The paper also proposes a new vertex mapping approach which minimizes complete exhaustionof substrate nodes while still providing good overall resource utilization. Experimental results are presented to show under whatcircumstances the proposed vertex mapping approach can provide superior VN embedding properties compared to the otherapproaches.QC 20120919</p

Site-to-Site VPN Technologies : A Survey

Virtual Private Network (VPN) is a popular way to build private networks using shared network infrastructure. A variety of VPN technologies exist today operating on different layers of OSI model. This paper presents a detailed survey and provides a classification of various types of VPNs. Layer 1 VPN is also included which is an emerging technology. Services offered by each VPN with implementation methods are described. Protocols, tunneling mechanisms and hardware components used for the deployment are also explored.Qc 2012020