Q-learning based Service Function Chaining using VNF Resource-aware Reward Model

Author(s):  
Doyoung Lee ◽  
Jae-Hyoung Yoo ◽  
James Won-Ki Hong
IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 157707-157723
Author(s):  
Jiachen Zu ◽  
Guyu Hu ◽  
Yang Wu ◽  
Dongsheng Shao ◽  
Jiajie Yan

2020 ◽  
Vol 152 ◽  
pp. 305-315 ◽  
Author(s):  
Guanglei Li ◽  
Bohao Feng ◽  
Huachun Zhou ◽  
Yuming Zhang ◽  
Keshav Sood ◽  
...  
Keyword(s):  

Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 646 ◽  
Author(s):  
Jian Sun ◽  
Guanhua Huang ◽  
Gang Sun ◽  
Hongfang Yu ◽  
Arun Kumar Sangaiah ◽  
...  

As the size and service requirements of today’s networks gradually increase, large numbers of proprietary devices are deployed, which leads to network complexity, information security crises and makes network service and service provider management increasingly difficult. Network function virtualization (NFV) technology is one solution to this problem. NFV separates network functions from hardware and deploys them as software on a common server. NFV can be used to improve service flexibility and isolate the services provided for each user, thus guaranteeing the security of user data. Therefore, the use of NFV technology includes many problems worth studying. For example, when there is a free choice of network path, one problem is how to choose a service function chain (SFC) that both meets the requirements and offers the service provider maximum profit. Most existing solutions are heuristic algorithms with high time efficiency, or integer linear programming (ILP) algorithms with high accuracy. It’s necessary to design an algorithm that symmetrically considers both time efficiency and accuracy. In this paper, we propose the Q-learning Framework Hybrid Module algorithm (QLFHM), which includes reinforcement learning to solve this SFC deployment problem in dynamic networks. The reinforcement learning module in QLFHM is responsible for the output of alternative paths, while the load balancing module in QLFHM is responsible for picking the optimal solution from them. The results of a comparison simulation experiment on a dynamic network topology show that the proposed algorithm can output the approximate optimal solution in a relatively short time while also considering the network load balance. Thus, it achieves the goal of maximizing the benefit to the service provider.


2021 ◽  
pp. 1500-1508
Author(s):  
Shaojun Zhang ◽  
Yutong Ji ◽  
Yufan Cheng ◽  
Ying Wang ◽  
Peng Yu

2010 ◽  
Vol E93-B (12) ◽  
pp. 3647-3650
Author(s):  
Bongjhin SHIN ◽  
Hoyoung CHOI ◽  
Daehyoung HONG

Sign in / Sign up

Export Citation Format

Share Document