A two-stage algorithm for the Virtual Network Embedding problem

Author(s):  
Massinissa Ait aba ◽  
Maxime Elkael ◽  
Badii Jouaber ◽  
Hind Castel-Taleb ◽  
Andrea Araldo ◽  
...  
Networks ◽  
2017 ◽  
Vol 71 (3) ◽  
pp. 188-208 ◽  
Author(s):  
Leonardo F.S. Moura ◽  
Luciano P. Gaspary ◽  
Luciana S. Buriol

Author(s):  
Isha Pathak ◽  
Deo Prakash Vidyarthi ◽  
Atul Tripathi

Business has transformed drastically over the years and cloud computing has emerged as an upcoming platform to provide all types of services, especially in the domain of digital business. Virtualization in cloud is a core activity, done at various levels, to support multiple services. Network virtualization is a significant aspect that liberates the users for seamless network access. Virtual network embedding is a process in which the demand of virtual nodes and virtual links are fulfilled by physical/substrate nodes and links while optimizing certain characteristic parameters. This chapter addresses the virtual network embedding problem to optimize parameters such as running time, residual physical network, and embedding cost using graph theory approach. It also minimizes the exhaustion of substrate network resources and still using its resources efficiently. In this chapter, a concept of graph theory has been applied for the virtual network embedding problem. The proposed model has been simulated for its performance study, and results reveal the efficacy of the method.


2014 ◽  
Vol 11 (4) ◽  
pp. 73-84 ◽  
Author(s):  
Huang Tao ◽  
Liu Jiang ◽  
Chen Jianya ◽  
Liu Yunjie

Sign in / Sign up

Export Citation Format

Share Document