scholarly journals An Edge-Based Approach for Virtual Network Embedding Based on the Graph Edit Distance

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.

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.


Entropy ◽  
2018 ◽  
Vol 20 (12) ◽  
pp. 941 ◽  
Author(s):  
Xinbo Liu ◽  
Buhong Wang ◽  
Zhixian Yang

To improve the low acceptance ratio and revenue to cost ratio caused by the poor match between the virtual nodes and the physical nodes in the existing virtual network embedding (VNE) algorithms, we established a multi-objective optimization integer linear programming model for the VNE problem, and proposed a novel two-stage virtual network embedding algorithm based on topology potential (VNE-TP). In the node embedding stage, the field theory once used for data clustering was introduced and a node embedding function designed to find the optimal physical node. In the link embedding stage, both the available bandwidth and hops of the candidate paths were considered, and a path embedding function designed to find the optimal path. Extensive simulation results show that the proposed algorithm outperforms other existing algorithms in terms of acceptance ratio and revenue to cost ratio.


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.


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.


Author(s):  
Bartosz Kopras ◽  
Filip Idzikowski ◽  
Wei-Che Chen ◽  
Te-Jen Wang ◽  
Chun-Ting Chou ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document