Assignment of Virtual Networks to Substrate Network for Software Defined Networks

2018 ◽  
Vol 8 (4) ◽  
pp. 29-48
Author(s):  
Ali Akbar Nasiri ◽  
Farnaz Derakhshan

Assigning multiple virtual network resources to physical network resources, called virtual network embedding (VNE), is known to be non-deterministic polynomial-time hard (NP-hard) problem. Currently software-defined networking (SDN) is gaining popularity in enterprise networks to improve the customizability and flexibility in network management service and reduced operational cost. A central controller in SDNs is an important factor that we need to take care of when we want to assign virtual networks to physical resources. In this work, we address virtual network embedding problems for SDNs. Indeed, our objective is to propose a method to assign virtual networks in the substrate network with minimum physical resources, and also minimizing delays between the virtual network controller and the switches in the virtual network. Our proposed algorithm considers the link and node constraints such as CPU and bandwidth constraints which is necessary to consider when we try to solve virtual network embedding problems.

2019 ◽  
Vol 2019 ◽  
pp. 1-11 ◽  
Author(s):  
Dhanu Dwiardhika ◽  
Takuji Tachibana

In this paper, in order to embed virtual networks by considering network security, we propose a virtual network embedding based on security level with VNF placement. In this method, virtual networks are embedded in a substrate network by considering security and some security VNFs are placed in order to increase the security level of substrate networks. By using our proposed method, many virtual networks can be embedded by considering security level. As a result, the reward can be increased and the cost of placing VNFs is not increased so much. We evaluate the performance of our proposed method with simulation. The performance of this method is compared with the performance of a method that places VNFs randomly and the performance of a method without placing VNFs. From numerical examples, we investigate the effectiveness of this method. In numerical examples, we show that the proposed method is effective in embedding virtual networks by considering network security.


2021 ◽  
Author(s):  
Ze Xi Xu ◽  
Lei Zhuang ◽  
Meng Yang He ◽  
Si Jin Yang ◽  
Yu Song ◽  
...  

Abstract Virtualization and resource isolation techniques have enabled the efficient sharing of networked resources. How to control network resource allocation accurately and flexibly has gradually become a research hotspot due to the growth in user demands. Therefore, this paper presents a new edge-based virtual network embedding approach to studying this problem that employs a graph edit distance method to accurately control resource usage. In particular, to manage network resources efficiently, we restrict the use conditions of network resources and restrict the structure based on common substructure isomorphism and an improved spider monkey optimization algorithm is employed to prune redundant information from the substrate network. Experimental results showed that the proposed method achieves better performance than existing algorithms in terms of resource management capacity, including energy savings and the revenue-cost ratio.


2012 ◽  
Vol 2012 ◽  
pp. 1-17 ◽  
Author(s):  
Adil Razzaq ◽  
Markus Hidell ◽  
Peter Sjödin

Virtual network embedding (VNE) is a key area in network virtualization, and the overall purpose of VNE is to map virtual networks 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 terms of vertices (nodes) and edges (links) with certain resource requirements, and, to embed a VN, substrate resources are assigned to these vertices and edges. Substrate networks have finite resources and utilizing them efficiently is an important objective for a VNE method. This paper analyzes two existing vertex mapping approaches—one which only considers if enough node resources are available for the current VN mapping and one which considers to what degree a node already is utilized by existing VN embeddings before doing the vertex mapping. The paper also proposes a new vertex mapping approach which minimizes complete exhaustion of substrate nodes while still providing good overall resource utilization. Experimental results are presented to show under what circumstances the proposed vertex mapping approach can provide superior VN embedding properties compared to the other approaches.


2017 ◽  
Vol 13 (8) ◽  
pp. 155014771772671
Author(s):  
Xu Liu ◽  
Zhongbao Zhang ◽  
Junning Li ◽  
Sen Su

Virtual network embedding has received a lot of attention from researchers. In this problem, it needs to map a sequence of virtual networks onto the physical network. Generally, the virtual networks have topology, node, and link constraints. Prior studies mainly focus on designing a solution to maximize the revenue by accepting more virtual networks while ignoring the energy cost for the physical network. In this article, to bridge this gap, we design a heuristic energy-aware virtual network embedding algorithm called EA-VNE-C, to coordinate the dynamic electricity price and energy consumption to further optimize the energy cost. Extensive simulations demonstrate that this algorithm significantly reduces the energy cost by up to 14% over the state-of-the-art algorithm while maintaining similar revenue.


2014 ◽  
Vol 1049-1050 ◽  
pp. 1454-1457
Author(s):  
Cong Wang ◽  
Ying Yuan ◽  
Cong Wan

Efficient network resource utilization is crucial in Virtual Network Embedding (VNE) problem. The diversity of virtual topologies belong to various services providers (SPs) severely affects the efficiency of VNE algorithms and fairness between SPs. This paper proposes a fair VNE algorithm with a topological transformation mechanism. Such mechanism will transform virtual topology to reduce complexity. Then the algorithm will felicitously map the virtual network onto substrate network through a Disperse Particle Swarm Optimization (DPSO) based process. Simulation results show that due to the topological transformation procedure the algorithm can achieve more fairness than traditional VNE algorithms.


2018 ◽  
Vol 14 (3) ◽  
pp. 155014771876478 ◽  
Author(s):  
Duc-Lam Nguyen ◽  
Hyungho Byun ◽  
Naeon Kim ◽  
Chong-Kwon Kim

Network virtualization is one of the most promising technologies for future networking and considered as a critical information technology resource that connects distributed, virtualized cloud computing services and different components such as storage, servers, and application. Network virtualization allows multiple virtual networks to coexist on the same shared physical infrastructure simultaneously. One of crucial factors in network virtualization is virtual network embedding which provisions a method to allocate physical substrate resources to virtual network requests. In this article, we investigate virtual network embedding strategies and related issues for resource allocation of an Internet provider to efficiently embed virtual networks that are requested by virtual network operators who share the same infrastructure provided by the Internet provider. In order to achieve that goal, we design a heuristic virtual network embedding algorithm that simultaneously embeds virtual nodes and virtual links of each virtual network request onto the physic infrastructure. Via extensive simulations, we demonstrate that our proposed scheme significantly improves the performance of virtual network embedding by enhancing the long-term average revenue as well as acceptance ratio and resource utilization of virtual network requests compared to prior algorithms.


2018 ◽  
Vol 60 (5-6) ◽  
pp. 293-306
Author(s):  
Amr Rizk ◽  
Jordi Bisbal ◽  
Sonja Bergsträßer ◽  
Ralf Steinmetz

Abstract The blockchain technology enables entities to query and alter information without trusting a middle party while providing a secure data storage in a decentralized manner. In this paper, we focus on an IT data supply chain scenario, where multiple actors negotiate a tenancy agreement for virtualized network resources. This process consists of service providers (SPs) requesting the embedding of specified virtual networks across multiple infrastructure providers (InPs). Since InPs are typically not willing to disclose detailed internal network information, this is a major deal breaker that hampers the efficiency of the service negotiation process. After reviewing the related work on centralized and decentralized virtual network embedding (VNE) approaches, we briefly discuss the reasons for a blockchain approach for this problem. Our approach comprises of a brokerless blockchain based system, that uses smart contracts and a VN partitioning algorithm based on the Vickrey auction model. Finally, we investigate the feasibility of our approach, by first analyzing the behavior of the introduced auction model in adverse conditions and by secondly evaluating the blockchain performance given different consensus protocols.


Sign in / Sign up

Export Citation Format

Share Document