Drops on surface optimization (DSO): A new reinforcement learning based metaheuristic algorithm for virtual network functions placement in distributed cloud architectures

被引:2
作者
Mohammadi, Marzieh [1 ]
Motamedi, S. Ahmad [1 ]
Sharifian, Saeed [1 ]
机构
[1] Amirkabir Univ Technol, Fac Elect Engn, Tehran, Iran
关键词
Cloud architecture; Metaheuristic algorithm; Network function virtualization (NFV); Optimization Reinforcement learning; Resource allocation; ENERGY-COST; NFV;
D O I
10.1016/j.comnet.2022.109459
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
With the goal of making the networks more agile, flexible and cost efficient, network function virtualization (NFV) is one of the latest and most promising technologies introduced. This technology is the key block of future internet and plays a critical role in modern networks. Using this paradigm, different network functions can be independently deployed on general purpose hardware instead of residing on dedicated hardware (network appliances in traditional networks). NFV enables faster development and lower costs. As any other new technology, NFV has some emerging challenges along with its benefits. The main research challenge of NFV is the necessity of optimally placing the virtual network functions (VNFs) in an NFV-enabled network. This problem is mainly known as the VNF placement (VNFP) problem in the literature. Due to the nature of network applications, this placement should be scalable for large network sizes. In this paper, the VNFP problem is addressed and a new metaheuristic algorithm is proposed based on the behavior of droplets on a surface, named the Drops on Surface Optimization (DSO) Algorithm. In order to enhance the proposed algorithm by dynamic selection strategy, a reinforcement learning approach (Q learning) is adopted. A comprehensive evaluation is carried out using standard networks, compared with several methods. Simulation results reveal that our proposed algorithm outperforms other state-of-the-art approaches in terms of total end-to-end propagation delay of the placed service chain, cost of placement, number of active servers involved in the placement and scalability.
引用
收藏
页数:11
相关论文
共 37 条
[1]  
[Anonymous], INTERNET TOPOLOGY ZO
[2]   Scalable and coordinated allocation of service function chains [J].
Beck, Michael Till ;
Botero, Juan Felipe .
COMPUTER COMMUNICATIONS, 2017, 102 :78-88
[3]   Optimal virtual network function placement in multi-cloud service function chaining architecture [J].
Bhamare, Deval ;
Samaka, Mohammed ;
Erbad, Aiman ;
Jain, Raj ;
Gupta, Lav ;
Chan, H. Anthony .
COMPUTER COMMUNICATIONS, 2017, 102 :1-16
[4]  
Colajanni G., 2022, IEEE COMMUN MAG
[5]   Optimal placement of virtual network functions in software defined networks: A survey [J].
Demirci, Sedef ;
Sagiroglu, Seref .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2019, 147
[6]  
Dijkstra EW., 1959, Numerische Mathematik, V1, P269, DOI [10.1007/BF01386390, DOI 10.1007/BF01386390]
[7]  
Dwaraki A., 2016, P ACM SIGCOMM WORKSH, P32
[8]   The physics of water droplets on surfaces: exploring the effects of roughness and surface chemistry [J].
Eid, K. F. ;
Panth, M. ;
Sommers, A. D. .
EUROPEAN JOURNAL OF PHYSICS, 2018, 39 (02)
[9]   MuSC: A multi-stage service chains embedding approach [J].
El Mensoum, Imane ;
Wahab, Omar Abdul ;
Kara, Nadjia ;
Edstrom, Claes .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2020, 159
[10]   A modified knowledge-based ant colony algorithm for virtual machine placement and simultaneous routing of NFV in distributed cloud architecture [J].
Farshin, Alireza ;
Sharifian, Saeed .
JOURNAL OF SUPERCOMPUTING, 2019, 75 (08) :5520-5550