A Policy-based Architecture for Virtual Network Embedding (original) (raw)
Related papers
VINEA: a policy-based virtual network embedding architecture
2013
Network virtualization has enabled new business models by allowing infrastructure providers to lease or share their physical network. To concurrently run multiple customized virtual network services, such infrastructure providers need to run a virtual network embedding protocol. The virtual network embedding is the (NP-hard) problem of matching constrained virtual networks onto the physical network. We present the design and implementation of the first policy-based architecture for the virtual network embedding problem. By policy, we mean a variant aspect of any of the (invariant) embedding mechanisms: resource discovery, virtual network mapping, and allocation on the physical infrastructure. Our architecture adapts to different scenarios by instantiating appropriate policies, and has bounds on embedding efficiency and on convergence embedding time, over a single provider, or across multiple federated providers. The performance of representative novel policy configurations are compa...
An Approach towards Resource Efficient Virtual Network Embedding
2010
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.
Virtual Network Embedding: A Survey
IEEE Communications Surveys & Tutorials, 2000
Network virtualization is recognized as an enabling technology for the future Internet. It aims to overcome the resistance of the current Internet to architectural change. Application of this technology relies on algorithms that can instantiate virtualized networks on a substrate infrastructure, optimizing the layout for service-relevant metrics. This class of algorithms is commonly known as "Virtual Network Embedding (VNE)" algorithms. This paper presents a survey of current research in the VNE area. Based upon a novel classification scheme for VNE algorithms a taxonomy of current approaches to the VNE problem is provided and opportunities for further research are discussed.
Optimal resource allocation in Virtual Network Embedding
2019
Optimal resource allocation has become a focus in the technological environment due to the high costs associated with physical infrastructure and space. Furthermore, Network Operators (NO)s have to keep up with the rate of change in this digital age. This led to the creation of network virtualization. Virtualizing a network means that the functionality of the network becomes independent of the physical hardware that supports it. A significant advantage is that the same physical server can be used for several different purposes depending on the software installed to enable faster and more efficient communication. To prevent stagnation of internet infrastructure, Virtual Network Embedding (VNE) has emerged as a promising component of the future Internet. Virtual networks (VNs) still requires a substrate infrastructure and over-provisioning and non-optimal resource allocation are, therefore, still a critical consideration when implementing VNEs. Virtual network embedding refers to the ...
ALEVIN - A Framework to Develop, Compare, and Analyze Virtual Network Embedding Algorithms
2011
Network virtualization is recognized as an enabling technology for the Future Internet. Applying virtualization of network resources leads to the problem of mapping virtual resources to physical resources, known as "Virtual Network Embedding" (VNE). Several algorithms attempting to solve this problem have been discussed in the literature, so far. However, comparison of VNE algorithms is hard, as each algorithm focuses on different criteria. To that end, we introduce a framework to compare different algorithms according to a set of metrics, which allow to evaluate the algorithms and compute their results on a given scenario for arbitrary parameters.
A re-optimization approach for virtual network embedding
Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST, 2013
Network Virtualization is claimed to be a key component of the Future Internet by enabling the coexistence of heterogeneous (virtual) networks in the same physical infrastructure, providing the dynamic creation and support of different networks with different paradigms and mechanisms in the same physical network. A major challenge in the dynamic provision of virtual networks resides in the optimal embedding solution of virtual resources into physical ones.
Survivable Virtual Network Embedding
Lecture Notes in Computer Science, 2010
Network virtualization can offer more flexibility and better manageability for the future Internet by allowing multiple heterogeneous virtual networks (VN) to coexist on a shared infrastructure provider (InP) network. A major challenge in this respect is the VN embedding problem that deals with the efficient mapping of virtual resources on InP network resources. Previous research focused on heuristic algorithms for the VN embedding problem assuming that the InP network remains operational at all times. In this paper, we remove that assumption by formulating the survivable virtual network embedding (SVNE) problem and developing a hybrid policy heuristic to solve it. The policy is based on a fast rerouting strategy and utilizes a pre-reserved quota for backup on each physical link. Evaluation results show that our proposed heuristic for SVNE outperforms baseline heuristics in terms of long term business profit for the InP, acceptance ratio, bandwidth efficiency, and response time.
Multi-Layer Virtual Network Embedding
IEEE Transactions on Network and Service Management , 2018
Network Virtualization (NV), considered as a key enabler for overcoming the ossification of the Internet allows multiple heterogeneous virtual networks to co-exist over the same substrate network. Resource allocation problems in NV have been extensively studied for single layer substrates such as IP or Optical networks. However, little effort has been put to address the same problem for multi-layer IP-over-Optical networks. The increasing popularity of multi-layer networks for deploying backbones combined with their unique characteristics (e.g., topological flexibility of the IP layer) calls for the need to carefully investigate the resource provisioning problems arising from their virtualization. In this paper, we address the problem of MUlti-Layer virtual network Embedding (MULE) on IP-over-Optical networks. We propose two solutions to MULE: (i) an Integer Linear Program (ILP) formulation for the optimal solution (OPT-MULE), and (ii) a heuristic to address the computational complexity of the optimal solution (FAST-MULE). We demonstrate through extensive simulations that on average our heuristic performs within ≈1.47× of optimal solution while executing several orders of magnitude faster. Simulation results also show that FAST-MULE incurs ≈66% less cost on average than the state-of-the-art heuristic while accepting ≈60% more VN requests on average.
A decomposition-based architecture for distributed virtual network embedding
Proceedings of the 2014 ACM SIGCOMM workshop on Distributed cloud computing - DCC '14, 2014
Network protocols have historically been developed on an ad-hoc basis, and cloud computing is no exception. A fundamental management protocol, not yet standardized, that cloud providers need to run to support wide-area virtual network services is the virtual network (VN) embedding protocol. In this paper, we use decomposition theory to provide a unifying architecture for the VN embedding problem. We show how our architecture subsumes existing solutions, and how it can be used by cloud providers to design a distributed VN embedding protocol that adapts to different scenarios, by merely instantiating different decomposition policies. We analyze key representative tradeoffs via simulation, and with our VN embedding testbed that uses a Linux system architecture to reserve virtual node and link capacities. In contrast with existing VN embedding solutions, we found that partitioning a VN request not only increases the signaling overhead, but may decrease cloud providers' revenue.
Network Virtualization (NV) allows multiple heterogeneous architectures to simultaneously coexist in a shared infrastructure. Embedding multiple virtual networks (VNs) in a shared substrate deals with efficient mapping of virtual resources in the physical infrastructure and is referred to as the Virtual Network Embedding problem (VNE-problem). Although there is recently a number of research work in the area of network virtualization based on the SoftwareDefined Networking (SDN) technology, virtual network embedding in SDN remains challenging from both theoretical and practical points of view. This article focuses on virtual network embedding strategies and related issues for Infrastructure-as-a-Service (IaaS) paradigms under the constraint of fixed virtual node locations. Special considerations are given to the problems related to resource allocation and link sharing of multi-layer virtual networks on top of the physical substrate. Firstly, a heuristic virtual network embedding algorithm is proposed that can improve the mapping acceptance ratio and resource efficiency in the IaaS context. Secondly, REsource reSERvation in generalized Virtual NETworks (ReServNet), a Software-Defined Networking platform designed for embedding multi-level virtual networks in physical infrastructures is developed. By defining new softwarized logical functions, ReServNet allows network administrators to create and manage multiple virtual networks on top of the physical network and allocate bandwidth resources to them accordingly. Moreover, the ReServNet framework allows for designing, prototyping, benchmarking and evaluating the performance of different network embedding algorithms easily in real SDN virtualization environments. Different issues related to virtual network embedding on SDN-based physical substrate are also analyzed and discussed in detail.