Fair Virtual Network Function Mapping and Scheduling Using Proximal Policy Optimization

Network function virtualization redefines a network service as a softwarized chain of virtual network functions (VNFs), which decouples the specific network service from dedicated devices and greatly reduces the hardware cost. The VNFs are generally deployed on common off-the-shelf servers and stati...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2022-11, Vol.70 (11), p.1-1
Main Authors: Kuai, Zhenran, Wang, Tianyu, Wang, Shaowei
Format: Article
Language:English
Subjects:
Chains
Decision trees
Deep reinforcement learning
Delays
Greedy algorithms
Hardware
Job shop scheduling
Machine learning
Mapping
network function virtualization
Optimization
proximal policy optimization
Quality of service
Resource management
Scheduling
Search algorithms
Servers
Solid modeling
Task scheduling
virtual network function mapping and scheduling
Virtual networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Network function virtualization redefines a network service as a softwarized chain of virtual network functions (VNFs), which decouples the specific network service from dedicated devices and greatly reduces the hardware cost. The VNFs are generally deployed on common off-the-shelf servers and statistically share computational resources. Due to the inherent integer constraints, the corresponding VNF mapping and scheduling issue is a highly challenging task. In this paper, we consider the mapping and scheduling of VNFs for a given network service, for which a flexible job shop scheduling problem is formulated to optimize the max-min fairness while ensuring the delay requirements of different service chains. Specifically, we propose a deep reinforcement learning method based on offline proximal policy optimization, which dynamically determines the mapping and scheduling decision based on the state of unfinished service chains. The proposed algorithm is scalable to the number of service chains and can be enhanced by Monte Carlo tree search. Numerical results show that the proposed algorithm outperforms the traditional random forest and the greedy algorithms in terms of both service fairness and acceptance ratio.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2022.3211071