当前位置:网站首页>Beijing University of Posts and Telecommunications - multi-agent deep reinforcement learning for cost and delay sensitive virtual network function placement and routing
Beijing University of Posts and Telecommunications - multi-agent deep reinforcement learning for cost and delay sensitive virtual network function placement and routing
2022-06-27 22:07:00 【Zhiyuan community】
【 title 】Multi-Agent Deep Reinforcement Learning for Cost- and Delay-Sensitive Virtual Network Function Placement and Routing
【 The author team 】Shaoyang Wang, Chau Yuen, Wei Ni
【 Date of publication 】2022.6.24
【 Thesis link 】https://arxiv.org/pdf/2206.12146.pdf
【 Recommended reasons 】 This paper presents an effective and novel multi-agent based deep reinforcement learning (MADRL) Methods , Used to solve the joint virtual network function (VNF) Layout and routing (P&R), It contains multiple service requests with different requirements at the same time . Differentiated requirements for service requests are reflected in their delays and cost sensitivities . The author first constructs a VNF P&R Problem to jointly minimize the weighted sum of service delay and resource consumption cost , This is a NP complete . then , union VNF P&R The problem is decoupled into two iterative subtasks : Place subtasks and routing subtasks . Each subtask consists of multiple concurrent sequential decision processes . By invoking the depth deterministic strategy gradient method and multi-agent technology , Designed a MADRL-P&R Framework to perform these two subtasks . New joint reward and internal reward mechanisms are proposed to match the goals and constraints of layout and routing subtasks . This paper also proposes a model retraining method based on parameter migration to deal with the changing network topology .
边栏推荐
- BAT测试专家对web测试和APP测试的总结
- Gbase 8A OLAP analysis function cume_ Example of dist
- \W and [a-za-z0-9_], \Are D and [0-9] equivalent?
- 正则表达式
- [LeetCode]515. 在每个树行中找最大值
- [leetcode] dynamic programming solution partition array i[red fox]
- 记一次List对象遍历及float类型判断大小
- VMware virtual machine PE startup
- Gbase 8A OLAP analysis function cume_ Example of dist
- Go from introduction to actual combat - execute only once (note)
猜你喜欢
Remote invocation of microservices
Système de gestion - itclub (II)
我想我要开始写我自己的博客了。
管理系统-ITclub(下)
洛谷P5706 再分肥宅水
Educational Codeforces Round 108 (Rated for Div. 2)
读写分离-Mysql的主从复制
年薪50W+的测试大鸟都在用这个:Jmeter 脚本开发之——扩展函数
Professor of Tsinghua University: software testing has gone into a misunderstanding - "code is necessary"
Codeforces Round #723 (Div. 2)
随机推荐
熊市慢慢,Bit.Store提供稳定Staking产品助你穿越牛熊
年薪50W+的测试大鸟都在用这个:Jmeter 脚本开发之——扩展函数
管理系统-ITclub(上)
[LeetCode]508. 出现次数最多的子树元素和
6G显卡显存不足出现CUDA Error:out of memory解决办法
GBase 8a OLAP分析函数cume_dist的使用样例
Simulink method for exporting FMU model files
gomock mockgen : unknown embedded interface
Bean paste green protects your eyes
The create database of gbase 8A takes a long time to query and is suspected to be stuck
使用Jmeter进行性能测试的这套步骤,涨薪2次,升职一次
Analysis of stone merging
读写分离-Mysql的主从复制
MONTHS_ Between function use
Codeforces Round #723 (Div. 2)
How to design an elegant caching function
Remote invocation of microservices
Method of reading file contents by Excel
[LeetCode]508. 出現次數最多的子樹元素和
GBase 8a OLAP分析函数 cume_dist的使用样例