基于学习的多资源管理效用最大化:海报摘要

Donghoon Lee, S. Chong
{"title":"基于学习的多资源管理效用最大化:海报摘要","authors":"Donghoon Lee, S. Chong","doi":"10.1145/3226052.3226060","DOIUrl":null,"url":null,"abstract":"This poster addresses the problem of Network Utility Maximization (NUM) where multiple resources (computing/networking) participate in user services. NUM has usually been solved by Backpressure algorithms which has to build up queue size gradualy. This disadvantage stands out in the situation of multi-resource environment or multi-hop networking. To address the problem, we propose a reinforcement learning based algorithm that utilizes future prediction to overcome the previous limitation of non-learning based algorithms.","PeriodicalId":409980,"journal":{"name":"Proceedings of the 13th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Learning based Utility Maximization for Multi-Resource Management: Poster Abstract\",\"authors\":\"Donghoon Lee, S. Chong\",\"doi\":\"10.1145/3226052.3226060\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This poster addresses the problem of Network Utility Maximization (NUM) where multiple resources (computing/networking) participate in user services. NUM has usually been solved by Backpressure algorithms which has to build up queue size gradualy. This disadvantage stands out in the situation of multi-resource environment or multi-hop networking. To address the problem, we propose a reinforcement learning based algorithm that utilizes future prediction to overcome the previous limitation of non-learning based algorithms.\",\"PeriodicalId\":409980,\"journal\":{\"name\":\"Proceedings of the 13th International Conference on Future Internet Technologies\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 13th International Conference on Future Internet Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3226052.3226060\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 13th International Conference on Future Internet Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3226052.3226060","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

这张海报解决了网络效用最大化(NUM)的问题,其中多个资源(计算/网络)参与用户服务。NUM通常通过Backpressure算法求解,该算法必须逐步建立队列大小。这种缺点在多资源环境或多跳组网的情况下尤为突出。为了解决这个问题,我们提出了一种基于强化学习的算法,该算法利用未来预测来克服以前非基于学习的算法的局限性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Learning based Utility Maximization for Multi-Resource Management: Poster Abstract
This poster addresses the problem of Network Utility Maximization (NUM) where multiple resources (computing/networking) participate in user services. NUM has usually been solved by Backpressure algorithms which has to build up queue size gradualy. This disadvantage stands out in the situation of multi-resource environment or multi-hop networking. To address the problem, we propose a reinforcement learning based algorithm that utilizes future prediction to overcome the previous limitation of non-learning based algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信