2022
DOI: 10.1109/tcomm.2022.3211071
|View full text |Cite
|
Sign up to set email alerts
|

Fair Virtual Network Function Mapping and Scheduling Using Proximal Policy Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 26 publications
0
5
0
Order By: Relevance
“…In summary, the total time consumption T total and the total energy consumption E total can be computed by Equations (11) and (12).…”
Section: The Time and Energy Consumptionmentioning
confidence: 99%
See 3 more Smart Citations
“…In summary, the total time consumption T total and the total energy consumption E total can be computed by Equations (11) and (12).…”
Section: The Time and Energy Consumptionmentioning
confidence: 99%
“…The number of multi-constrained task sets [2][3][4][5][6][7][8][9][10][11][12][13][14] The number of edge servers [14][15][16] The virtual machine capacity of edge servers [15][16][17][18][19][20][21][22][23][24][25][26][27][28][29][30] The CPU frequency of edge servers [2000-2500] MHz…”
Section: Parameter Valuementioning
confidence: 99%
See 2 more Smart Citations
“…In [15], the authors study the problem of differentiated routing considering SFC in SDN and NFV networks, the resource aware routing algorithm is proposed to solve the differentiated routing problem which is formulated as a binary integer programming model aiming to minimize the resource consumption cost of flows with SFC requests. In [16], the authors propose a deep reinforcement learning method with offline proximal policy optimization to solve the problem of VNF mapping and scheduling with the objective of maximizing the fairness of different services while ensuring the corresponding delay requirements. In [17], a dynamic SFC orchestration framework has been created in the context of the Industrial Internet of Things, and the joint optimization problem is decomposed into two subproblems: SFC selection and dynamic SFC orchestration.…”
Section: Introduction 1backgroundmentioning
confidence: 99%