Q-learning with function Approximator for clustering based Optimal resource Allocation in fog environment

Chanchal Ahlawat, R. Krishnamurthi
{"title":"Q-learning with function Approximator for clustering based Optimal resource Allocation in fog environment","authors":"Chanchal Ahlawat, R. Krishnamurthi","doi":"10.1145/3549206.3549230","DOIUrl":null,"url":null,"abstract":"Fog computing is a new paradigm for delivering services close to the user. The exponential growth of IoT devices and big data complicates fog resource distribution. Inefficient resource allocation can result in resource scarcity and the inability to finish a task assignment on time. As a result, correct allocation is required to improve the efficiency of fog resources. Resource allocation is a difficult task with heterogeneous constraint resources. As fog computing deals with real-time data, therefore, needs resource allocation in real-time that increases the necessity of having appropriate and optimal resource allocation in real-time. Therefore, this paper targets optimal resource allocation. To address the resource allocation problem, Q-learning with function Approximator for clustering based Optimal resource Allocation (QL(FA)-CORA) model is designed, considering the problem as a decision making problem, reinforcement learning method is used to solve it. Problem formulation is done using the Markov decision process. Clustering is done to reduce the service time. Proposed an optimal resource allocation using the QL function approximator (ORA- QLFA) algorithm. to enhance the efficiency and performance of the proposed fog environment. Simulations are done to evaluate the validation of the proposed algorithm. Also, comparisons are made with linear Q networks using different parameters such as expected discounted return, maximum steps taken by the fog resource controller, etc. Simulation results show the proposed algorithm performs better in all the cases and converged to optimal results after a few iterations rather than a linear Q network.","PeriodicalId":199675,"journal":{"name":"Proceedings of the 2022 Fourteenth International Conference on Contemporary Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2022 Fourteenth International Conference on Contemporary Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3549206.3549230","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Fog computing is a new paradigm for delivering services close to the user. The exponential growth of IoT devices and big data complicates fog resource distribution. Inefficient resource allocation can result in resource scarcity and the inability to finish a task assignment on time. As a result, correct allocation is required to improve the efficiency of fog resources. Resource allocation is a difficult task with heterogeneous constraint resources. As fog computing deals with real-time data, therefore, needs resource allocation in real-time that increases the necessity of having appropriate and optimal resource allocation in real-time. Therefore, this paper targets optimal resource allocation. To address the resource allocation problem, Q-learning with function Approximator for clustering based Optimal resource Allocation (QL(FA)-CORA) model is designed, considering the problem as a decision making problem, reinforcement learning method is used to solve it. Problem formulation is done using the Markov decision process. Clustering is done to reduce the service time. Proposed an optimal resource allocation using the QL function approximator (ORA- QLFA) algorithm. to enhance the efficiency and performance of the proposed fog environment. Simulations are done to evaluate the validation of the proposed algorithm. Also, comparisons are made with linear Q networks using different parameters such as expected discounted return, maximum steps taken by the fog resource controller, etc. Simulation results show the proposed algorithm performs better in all the cases and converged to optimal results after a few iterations rather than a linear Q network.
基于函数逼近的q学习雾环境下聚类资源优化分配
雾计算是一种贴近用户交付服务的新范例。物联网设备和大数据的指数级增长使雾资源分配复杂化。低效的资源分配会导致资源稀缺和无法按时完成任务分配。因此,为了提高雾资源的利用效率,需要正确配置雾资源。在异构约束条件下,资源分配是一项困难的任务。因此,由于雾计算处理的是实时数据,因此需要实时地进行资源分配,这就增加了实时地进行适当和最优的资源分配的必要性。因此,本文以资源优化配置为目标。针对资源分配问题,设计了基于聚类的q -学习函数逼近器的最优资源分配(QL(FA)-CORA)模型,并将其视为决策问题,采用强化学习方法进行求解。问题的表述是使用马尔可夫决策过程完成的。集群是为了减少服务时间。提出了一种基于QL函数逼近器(ORA- QLFA)的资源优化分配算法。提高雾环境的效率和性能。通过仿真验证了所提算法的有效性。此外,还与使用不同参数的线性Q网络进行了比较,如期望贴现收益率、雾资源控制器采取的最大步骤等。仿真结果表明,该算法在所有情况下都具有更好的性能,并且与线性Q网络相比,只需几次迭代即可收敛到最优结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信