Heterogeneous Flow Scheduling using Deep Reinforcement Learning in Partially Observable NFV Environment

Chun Jen Lin, Yan Luo, Liang-Min Wang
{"title":"Heterogeneous Flow Scheduling using Deep Reinforcement Learning in Partially Observable NFV Environment","authors":"Chun Jen Lin, Yan Luo, Liang-Min Wang","doi":"10.1109/NaNA53684.2021.00081","DOIUrl":null,"url":null,"abstract":"Deep Reinforcement Learning (DRL) has yielded proficient controllers for complex tasks. DRL trains machine learning models for decision making to maximize rewards in uncertain environments such as network function virtualization (NFV). However, when facing limited information, agents often have difficulties making decisions at some decision point. In a real-world NFV environment, we may have incomplete information about network flow patterns. Compared with complete information feedback, it increases the difficulty to predict an optimal policy since important state information is missing. In this paper, we formulate a Partially Observable Markov Decision Process (POMDP) with a partially unknown NFV system. To address the shortcomings in real-world NFV, we conduct an extensive simulation to investigate the effects of adding recurrency to a Proximal Policy optimization (PPO2) by replacing the first post-convolutional fully-connected layer with a recurrent LSTM or adding stacked frames as input. The results show that RL based schedulers using stacking a history of frames in the PPO2’s input layer can easily adapt at evaluation time if the quality of observations changes.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"393 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Networking and Network Applications (NaNA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NaNA53684.2021.00081","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Deep Reinforcement Learning (DRL) has yielded proficient controllers for complex tasks. DRL trains machine learning models for decision making to maximize rewards in uncertain environments such as network function virtualization (NFV). However, when facing limited information, agents often have difficulties making decisions at some decision point. In a real-world NFV environment, we may have incomplete information about network flow patterns. Compared with complete information feedback, it increases the difficulty to predict an optimal policy since important state information is missing. In this paper, we formulate a Partially Observable Markov Decision Process (POMDP) with a partially unknown NFV system. To address the shortcomings in real-world NFV, we conduct an extensive simulation to investigate the effects of adding recurrency to a Proximal Policy optimization (PPO2) by replacing the first post-convolutional fully-connected layer with a recurrent LSTM or adding stacked frames as input. The results show that RL based schedulers using stacking a history of frames in the PPO2’s input layer can easily adapt at evaluation time if the quality of observations changes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
部分可观察NFV环境下基于深度强化学习的异构流调度
深度强化学习(DRL)已经为复杂任务产生了熟练的控制器。DRL训练机器学习模型用于决策制定,以在不确定环境(如网络功能虚拟化(NFV))中最大化回报。然而,当面对有限的信息时,代理往往在某些决策点上难以做出决策。在真实的NFV环境中,我们可能拥有关于网络流模式的不完整信息。与完全信息反馈相比,由于缺少重要的状态信息,增加了预测最优策略的难度。本文给出了一个部分未知NFV系统的部分可观察马尔可夫决策过程(POMDP)。为了解决现实NFV中的缺点,我们进行了广泛的模拟,通过用循环LSTM替换第一个后卷积全连接层或添加堆叠帧作为输入,来研究在近端策略优化(PPO2)中添加递归的效果。结果表明,基于RL的调度程序在PPO2的输入层中堆叠帧历史,如果观测质量发生变化,则可以在评估时轻松适应。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Covert Communication in D2D Underlaying Cellular Network Online Scheduling of Machine Learning Jobs in Edge-Cloud Networks Dual attention mechanism object tracking algorithm based on Fully-convolutional Siamese network Fatigue Detection Technology for Online Learning The Nearest Neighbor Algorithm for Balanced and Connected k-Center Problem under Modular Distance
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1